Data Structure & Algorithm: Here is an array of ten integers: 5  3  8  9  1  7  0  2  6  4 Draw this array after two (2) Interactions of any two (2) of the following sort algorithm. a) Bubble Sort b)Insertion Sort c)Selection sort d) Quicksort. Discuss the time complexity and efficiency of the two sort algorithms you chose.

Write the state/order of the elements of the following array after each pass of the outermost loop of the Selection sort algorithm [ 8, 5, -9, 14, 0, -1, -7, 3 ] for example,  1st pass: -9, 5, 8, 14, 0, -1, -7, 3 2nd pass:  3rd pass:  4th pass:

Sort Realize direct insertion sort, half insertion sort, bubble sort, quick sort, select sort, heap sort and merge sort. Raw data is generated randomly. For different problem size, output the number of comparisons and moves required by various sorting algorithms When the program is running, input the problem size from the keyboard, the source data is randomly generated by the system, and then output the comparison times and movement times required by various sorting algorithms under this problem scale.    do this in C langauge ...it should ne able to do like the attached picture

Subj:- Design & Anal Algorithms Please compelete all the three questions since it has to be answereda once. Thank you in advance. Three animals stand next to each other by size, as follows: An Elephant, followed by a Hippo, followed by a Panda bear, [E, H, P]. Your goal is to re-arrange them so that they are sorted in the opposite size-based order. You are only allowed to switch positions of neighboring animals. Do not use Insertion or Merge sort. Try to use your own strategy to re-arrange the array. (a) How many operations do you need to reverse the order of the three animals? (b) Let’s generalize the above. You have an array of n elements whose ordering you want to revers. Write pseudo code to do this. (c) How many operations do you need to reverse the ordering of an array of n? Your answer should be a function of n.

Computer Science Algorithm and Complexity

explain Selection sort algorithm.

A merge sort is used to sort an array of 1000 test scores in descending order. Which of the following statements is true?a) The sort is fastest if the original test scores are sorted from smallest to largestb) The sort is fastest if the original test scores are in completely sorted order.c) The sort is fastest if the original test scores are sorted from largest to smallest.d) The sort is the same, no matter what the order of the original elements.

Please written by computer source

What is the time complexity for the following code/program?  1.5 A binary search works like this: in a sorted array, the search algorithm compares the target value to the middle element of the array. If they are not equal, the half in which the target cannot lie is eliminated and the search continues on the remaining half, again taking the middle element to compare to the target value and repeating this until the target value is found. If the search ends with the remaining half being empty, the target is not in the array. What is the complexity of binary search? Why?

Part 1 1. Write a permutation of 9 integers which is not in sorted order. Sort the integers using the sorting algorithms: Bubble Sort, Insertion Sort, Selection Sort and Quick Sort. Assume that the numbers are stored in an array. You should show the contents of the array after each iteration for all the algorithms. 2. Suppose you are to sort elements which are stored in a very large sorted array followed by a relatively small number of "random" elements. Which of the sequential sorting algorithms from Part 1.1 would be especially suitable for such a task? Justify your choice. 3. What issues are significant when assessing the relative merits of different sorting algorithms? Compare and contrast the sorting algorithms with respect to these criteria.