1. Consider the algorithm for the sorting problem that sorts an array by counting, for each of its elements, the number of smaller elements and then uses this information to put the element in its appropriate position in the sorted array: ALGORITHM ComparisonCountingSort(A[0..n − 1]) //Sorts an array by comparison counting //Input: Array A[0..n //Output: Array S[0..n − 1] of orderable values − 1] of A’s elements sorted // in nondecreasing order for i ← 0 to nCount− 1 do[i]←0 for i ← 0 to n − 2 do for j ← i +1 to n − 1 do if A[i] < A[j ] Count[j ]← Count[j ] + 1 else Count[i]← Count[i] + 1 for i ←0 to n−1 do S[Count[i]]←A[i] return S a. Apply this algorithm to sorting the list 60, 35, 81, 98, 14, 47.

Shell sort is an in-place comparison-based sorting algorithm which is based on insertion sort algorithm. It works as follow : It breaks the original list into a number of smaller sublists, each of which is sorted using an insertion sort. The unique way that these sublists are chosen is the key to the shell sort. Instead of breaking the list into sublists of contiguous items, the shell sort uses an increment i, sometimes called the gap, to create a sublist by choosing all items that are i items apart. n a) We say that the our initial gap is floor: when we divide our sequence into 2k n sublists where 2k k>0 be the number of passes that can be increment until the denominator not greater than n, n and then sorting the elements which are position away with insertion sort. We have three 2k passes for an array size of 8 to 15. Demonstrate the Shell algorithm on the input array A = [35,33,42,10,14,19,27,44] showing how even- %3D п tually the algorithm outputs the sorted array…

You are given an array A[1, ., n] in which the elements A[2] to A[n] are already sorted, i.e., A[2, .., n] is a sorted array. Write down an efficient algorithm with proper pseudocode for moving A[1] in the correct place, so that the full array A[1, ..., n] is sorted.

Write a C program that gets a positive integer number, n, from the user, and generates n positive random integer values and stores them in a one-dimensional array. Then it starts the timer and sorts the numbers in ascending order using bubble sort technique and display the sorted array on the screen along with the elapsed time. • Bubble Sort is a simple sorting algorithm that works by continually swapping the adjacent elements in an unsorted array if they are not in a right order. Please explain each step as I would like to understand and not copy. Thank you!