data structures using exercises review questions which technique of searching an element in an array would you prefer to use and in which situation define sorting what is the importance of sorting what are the different types of sorting techniqueswhich sorting technique has the least worst case explain the difference between bubble sort and quick sort which one is more efficient sort the elements using (ainsertion sort (bselection sort (cbubble sort (dmerge sort (equick sort (fradix sort (gshell sort compare heap sort and quick sort quick sort shows quadratic behaviour in certain situations justify if the following sequence of numbers is to be sorted using quick sortthen show the iterations of the sorting process sort the following sequence of numbers in descending order using heap sort certain sorting technique was applied to the following data set after two passesthe rearrangement of the data set is given as below identify the sorting algorithm that was applied certain sorting technique was applied to the following data set after two passesthe rearrangement of the data set is given as below identify the sorting algorithm that was applied certain sorting technique was applied to the following data set after two passesthe rearrangement of the data set is given as below identify the sorting algorithm that was applied write recursive function to perform selection sort compare the running time complexity of different sorting algorithms discuss the advantages of insertion sort programming exercises write program to implement bubble sort given the numbers and how many swaps will be performed to sort these numbers using the bubble sort write program to implement sort technique that works by repeatedly stepping through the list to be sorted write program to implement sort technique in which the sorted array is built one entry at time write program to implement an in-place comparison sort write program to implement sort technique that works on the principle of divide and conquer strategy write program to implement partition-exchange sort write program to implement sort technique which sorts the numbers based on individual digits write program to sort an array of integers in descending order using the following sorting techniques(ainsertion sort (bselection sort (cbubble sort (dmerge sort (equick sort (fradix sort (gshell sort write program to sort an array of floating point numbers in descending order using the following sorting techniques(ainsertion sort (bselection sort (cbubble sort (dmerge sort (equick sort (fradix sort (gshell sort write program to sort an array of names using the bucket sort