[Solved]-Question 3 Short Indicate 0333 Following Algorithems Data Set B C F Sie N 8 10 C 10 Orithm Q37196984

Question 3: Short indicate the 0.333- the following algorithems on a data set (A,B and C f sie N 8. 10 C: 10 orithm of sorting Data set A using Selection sort in ascending orer of sorting Data set A using Selection sort in descending order sorting Data set A using Insertion sort in ascending rder. Time complexity of 4 T Time complexity of sorting Data set A using Insertion sort in Time complexity of sorting Data set B using Selection sort in ascending order § | Time sort in ascending order complexity of sorting Data set B using Insertion ZSpace Complexity of the algorithm in 1,2,3,4,5 and6 8. Time complexity of Merge sort in ascending order of the dataset A 9 Time complexity of Merge sort in ascending order of the dataset B 10 Time complexity of sorting Data set C using Selection sort in ascending order. Time complexity of sorting Data set C using Merge sort in ascending order. 2 Time complexity of sorting Data set D using Merge sort in ascending order Sequential search for number 1 in data set A Sequential search for number 1 in data set B Sequential search for number 1 in data set C Binary search for number 1 in data set C Binary search for number 1 in data set D Show transcribed image text Question 3: Short indicate the 0.333- the following algorithems on a data set (A,B and C f sie N 8. 10 C: 10 orithm of sorting Data set A using Selection sort in ascending orer of sorting Data set A using Selection sort in descending order sorting Data set A using Insertion sort in ascending rder. Time complexity of 4 T Time complexity of sorting Data set A using Insertion sort in Time complexity of sorting Data set B using Selection sort in ascending order § | Time sort in ascending order complexity of sorting Data set B using Insertion ZSpace Complexity of the algorithm in 1,2,3,4,5 and6 8. Time complexity of Merge sort in ascending order of the dataset A 9 Time complexity of Merge sort in ascending order of the dataset B 10 Time complexity of sorting Data set C using Selection sort in ascending order. Time complexity of sorting Data set C using Merge sort in ascending order. 2 Time complexity of sorting Data set D using Merge sort in ascending order Sequential search for number 1 in data set A Sequential search for number 1 in data set B Sequential search for number 1 in data set C Binary search for number 1 in data set C Binary search for number 1 in data set D

Expert Answer

---

Answer to Question 3: Short indicate the 0.333- the following algorithems on a data set (A,B and C f sie N 8. 10 C: 10 orithm of s… . . .