Question: 1. Choose one searching and sorting algorithm each of your choice and Describe each of the algorithm with examples i. compare their performance write

1. Choose one searching and sorting algorithm each of your choice and

1. Choose one searching and sorting algorithm each of your choice and Describe each of the algorithm with examples i. compare their performance write the advantages and disadvantages of each algorithm ii. iii. 2. You are to sort a list L consisting of a sorted list followed by a few "random" elements. Which of sorting methods would be especially suitable for such a task? Explain your reason. 3. Which searching technique/s takes O (1) time to find a data. Give reasons. 4. Describe with illustrations number of interchanges required to sort 5, 1, 6, 2 4 in ascending order using Bubble Sort.

Step by Step Solution

3.49 Rating (146 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

So one searching technique is Linear Search and one sorting technique is Bubble Sort Linear Search Linear search is also called as sequential search algorithm It is the simplest searching algorithm In ... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Algorithms Questions!