Create and test predictions regarding the insertion sort and selection sort running times for arrays with just two key values, assuming that the values are equally likely to occur.

2. Use the insertion sort to sort 6, 2, 3, 1, 5, 4, showing the lists obtained at each step. Justify your answer using pseudocode in every step.

I need help with this merge sort question

desingn and implement parallel sort algorithm using MPI An array of given size is to be sorted. The size, the type of array and type of sort  technique should be considered optional

Please written by computer source

Below is the exercise for unsorted arrays. True or False: For each statement below, indicate whether you think it is True or False 3) For the insert function, if the array is empty, there are no comparison operations that need to be performed and you can immediately add the new element 5) Because the update algorithm depends on using linear search, its performance is O(1) in the worst case scenario 6) If you search for and delete an element in an unsorted array and then shift the rest of the elements to fill the hole, the worst case performance is O(n) 7) If you search for and delete an element in an unsorted array and then move the last element to fill the hole, the worst case performance is O(n)

Using selection sort, Sort the following array from greatest to least write down what the array AA and the sortedsorted array will look like at each step.

Compare the performance of selection shell sort, bubble sort and bubble sort2 interms of time and space complexity?

Create and test assumptions regarding the running times of insertion sort and selection sort for arrays with just two key values, assuming the values are equally likely to occur.

explain Selection sort algorithm.