1. Given the unsorted array write the pseudo code so sort it and find a specific element x a. Find (array, x) //first sort the array //search for element x using binary search
1. Given the unsorted array write the pseudo code so sort it and find a specific element x
a. Find (array, x)
//first sort the array
//search for element x using binary search
2. Given the following stack A = { 29,18,10,15,20,9,5,13,2,4,15}
Create a queue by taking the elements from the top of the stack and adding them to a queue
3. what are the worst-case, average-case, and best-case complexities of insertion-sort, merge-sort, and quiksort
4. Given the following array A = {3,13,89,34,21,44,99,56,9}
Illustrate the execution of the sorting algorithms on the given array:
* Merge-sort
* Quicksort (using the median-of-three pivot) algorithms
* Selection Sort algorithm
For each fundamental iteration or recursion of the algorithm, write the content of the array.
5. Evaluate the following postfix expression made using a stack: 234*5*-
Trending now
This is a popular solution!
Step by step
Solved in 3 steps
