Question

2.2.1. You are looking for your favorite t-shirt in your dresser. Your dresser has n drawers. • What search algorithm are you using? Note: you have to use the most efficient algorithm for the task. Justify your answer. Your answer goes here: ... • What is the worst-case scenario for your search and how much does it cost? Justify your answer. Your answer goes here: ... 2.2.2. Your company is contracted to implement a sorting algorithm for a client. Your client informs you that the data to be sorted is usually almost sorted, just not fully sorted. • What sorting algorithm would you recommend your company implements to always achieve best performance? Justify your answer. Your answer goes here: ... • What performance can you expect your algorithm to achieve (to sort n pieces of data that are almost sorted)? Justify your answer. Your answer goes here: ...

Answer 1

PAGE NO 1 2.2.1 T-shirt & will use linear search. or searching my Linear Search :- This technique starts searching for an item limearly from Linear search is best in this case because it is apply insually one end to another. more convenient to linear search manmou We cannot apply binary search here. I will find T-shirt In worst case scenario in last drawer which is by nth drawer. It will cost me (n* amount of time to look into 1 drawer) 6:2:2 In order to achieve best performance, I will suggest Insertion Sorti array Insertion Sort is best suited for an which is almost sorted: because the number of comparison is least § can expect a O(p). time complexity of order nie Insertion sort starts from 2nd element and search backward for an element greater than that elemen) get For sorted elements in every only comparison will be made. case one