Using the method that decreases k by 1 after each pass, sort the following list of numbers using the shell sort ( k=3 ): 13 9 5 7 12 2 3 14 6 1

Given a set of numbers: A = {3, 41, 52, 26, 38, 57, 9, 49}. Use merge-sort to sort the array. Show each step. Use quick-sort to sort the array. Show each step. How many “comparisons” for each algorithm above No code needed just break it down like this   3 41 52 26 38 57 9 49   3 41 52 26 38 57 9 49

Write a program that randomly generates 1,200,000 integers andsorts them using radix sort.

Create a 1D integer array of size 17. Fill each index with a random value ranging from 1 to 359 inclusive. You will then design and implement the Random Sort algorithm using the following methods: Create a method called check_if_sorted (). It should take in a 1D integer array and return a boolean value. It should return TRUE if the array is sorted in nondescending order, and FALSE otherwise. Hint: If you compare elements in the array and a pair is in the wrong order, that would mean the array is not in non-descending order. Create a method called shuffleArray (). It should take in a 1D integer array and return a 1D integer array. Shuffle the array so that the values are in random different indexes, and return altered array. Hint: There are many approaches to solve this problem – making a second array in the shuffleArray () method might be part of the answer. Create a method called PrintArray (). It should take in a 1D integer array and return nothing. Simply print the current values…

none

In this programming, you learn more about efficiency of algorithms based upon run time. Hence you need to use time() or clock() function to measure the execution of sorting algorithms and bubble binary-search. You may use the program we have been working in class since last week. Here you are asked to use the following to create an array, Num[8192]. -Size of the array bubble ● bubble bubble Use srand() to generate a random number each time; o Range of the random numbers should be 0... 10000. The expected outcome looks like the following: Binary sort takes xxx seconds. Selection sort takes xxx milliseconds. Implement the binary search for the following numbers; there would be no match depending on the generated Num[8942] Insert time-measurement statements to print it in seconds or milliseconds. O We will be working on it in class using clock (); Find these numbers and print the number of If-comparisons for 71, 9997, 5000, 2, 3015; Binary search 71 takes 8 comparisons-found Binary search…

Do a radix sort on the following numbers 456, 753, 1, 21, 22, 543, 40, 400, 2222, and  select three integer N where 45 < N < 1764  – For a total of 12 numbers to sort.  Show the resulting sort after each pass in a table, like shown below. Pass 1                                                              Pass 2                                                             Pass 3                                                             Pass 4

What is the worst case running time for finding the kth value in an array?

using selection sort algorithm, the intermediate sorting results of sorting the array (1,3,24,19,5,2} in Descending order are: starting: {12,4,25,20,6,3,100} Result of the first iteration: Result of the second iteration: Result of the third iteration: Result of the fourth iteration: { Result of the fifth iteration:

You are given an array J[1 : n] which includes the scores of n players in a game. You are additionally given an array P[1 : m] with the score of m new players. Design and analyze an algorithm that given both arrays J and P, can find the rank of each player P inside the array J, i.e., for each P[i], determines what would be the rank of P[i] in the array consisting of all elements of J plus P[i]. Your algorithm should run in O((n + m) ·log n) time.