Across
- 3. Consider an array has 10 elements and the searching element is at array index 6. A starting element is present at index zero. How many comparisons(answer in words) are required to search an element using linear search?
- 5. Consider an array of positive integers between 123456 to 876543,___________ sorting algorithm can be used to sort these number in linear time?
- 7. What is the key operation in Insertion Sort?
- 8. Sorting method that repeatedly selects the minimum element?
Down
- 1. In binary search, _________ bound is updated when item to be found is greater than a[mid]
- 2. What's the time complexity of Radix Sort?( linear/ quadratic/ poly, etc)
- 4. What is the time complexity of insertion sort in the worst case?( linear/ quadratic/ poly, etc)
- 6. The basic idea behind insertion sort: "Divide and _____."