1. Device an algorithm for a binary search implementing a Decrease by factor algorithm. Compute for...

   

Transcribed Image Text:

1. Device an algorithm for a binary search implementing a Decrease by factor algorithm. Compute for its running time. When will be the time it is in best case, average and worst case. 2. Show how shaker sort will be implemented when sorting data in ascending order: 98436 10 2 23 156 3. Compute how the course will be taken using Topological sort. 142 143 378 321 370 341 401 326 322 421 4. Give example of problems where Shaker Sort and Topological Sort are being used. Discuss how these algorithms were used to solve the problems. 1. Device an algorithm for a binary search implementing a Decrease by factor algorithm. Compute for its running time. When will be the time it is in best case, average and worst case. 2. Show how shaker sort will be implemented when sorting data in ascending order: 98436 10 2 23 156 3. Compute how the course will be taken using Topological sort. 142 143 378 321 370 341 401 326 322 421 4. Give example of problems where Shaker Sort and Topological Sort are being used. Discuss how these algorithms were used to solve the problems.

Answer rating: 100% (QA)

The image appears to be a screenshot containing a list of questions related to algorithms Lets address each question one by one 1 Devise an algorithm for a binary search implementing a Decrease by fac... View the full answer