1) Using the method of Merge sort, arrange data element in the ascending order for the array ‘A’ that is given below and state its complexity.
A={66,33,40,22,55,88,60,11,80,20,50,44,77,30}
2) Using the Selection sort method, arrange data element in the ascending order for array ‘A’ given below and state what is its complexity.
A= {56, 12, 22, 65, 78}
3) Write comparison between linear search and binary search techniques.
4) Using the bubble sort method, arrange data element in the ascending order for the array ‘A’ given below:
A={66,33,40,22,55,88,60,11,80,20,50,44,77,30}
5) Determine the position of element 42 by using the linear search method in the array A given below
A = {9, 93, 16, 34, 42, 58}.
6) Discuss the method of Quick sort by explaining the sorting of following given example.
A = {9, 93, 16, 34, 42, 58}.
7) Using the Radix sort method, arrange the data element in the ascending order for the array ‘A’ given below:
A = {1234, 348, 143, 423, 76, 5}
8) Consider the array A = {5, 16, 24, 64, 96, 106, 125, and 150}
Determine the number of comparison essential to find the position of element Ninety six within the given array by using binary search method.
9) Write down the program for explaining the insertion sort.