 |  Searching & Sorting 48 Flashcards |  Start |
 | What is the time complexity of linear search in the worst case? |  Card: 1 / 48 |
| O(n) | Card: 2 / 48 |
| Fill in the blank: Linear search is also known as ______. | Card: 3 / 48 |
| Sequential search | Card: 4 / 48 |
| True or False: Binary search can be performed on an unsorted array. | Card: 5 / 48 |
| False. Binary search requires the array to be sorted. | Card: 6 / 48 |
| What is the average case time complexity of binary search? | Card: 7 / 48 |
| O(log n) | Card: 8 / 48 |
| Riddle: I split an array into halves and conquer, using a pivot to sort every number. What am I? | Card: 9 / 48 |
| Quick Sort | Card: 10 / 48 |
| What is the primary advantage of using binary search over linear search? | Card: 11 / 48 |
| Binary search has a time complexity of O(log n), making it faster for large datasets compared to O(n) for linear search. | Card: 12 / 48 |
| In the context of sorting algorithms, what does the term 'stable' refer to? | Card: 13 / 48 |
| A stable sorting algorithm maintains the relative order of records with equal keys. | Card: 14 / 48 |
| Fill in the blank: The time complexity of merge sort is ______ in all cases. | Card: 15 / 48 |
| O(n log n) | Card: 16 / 48 |
| True or False: Merge sort is an in-place sorting algorithm. | Card: 17 / 48 |
| False. Merge sort requires additional space for the temporary array. | Card: 18 / 48 |
| What is the main principle behind the quick sort algorithm? | Card: 19 / 48 |
| Divide and conquer | Card: 20 / 48 |
| Riddle: I can sort numbers, but I need a good pivot to avoid a mess. What am I? | Card: 21 / 48 |
| Quick Sort | Card: 22 / 48 |
| What is the space complexity of the iterative implementation of binary search? | Card: 23 / 48 |
| O(1) | Card: 24 / 48 |
|  Unlock all Flashcards with EduRev Infinity Plan Starting from @ ₹99 only | |
| Fill in the blank: The average case time complexity of selection sort is ______. | Card: 25 / 48 |
| O(n²) | Card: 26 / 48 |
| What is the auxiliary space complexity of bubble sort? | Card: 27 / 48 |
| O(1) | Card: 28 / 48 |
| True or False: Counting sort can sort negative numbers directly without modifications. | Card: 29 / 48 |
| False. Counting sort needs modifications to handle negative numbers. | Card: 30 / 48 |
| What is the major drawback of using bubble sort? | Card: 31 / 48 |
| It has a time complexity of O(n²) making it inefficient for large datasets. | Card: 32 / 48 |
| Riddle: I take many passes but can be efficient if almost sorted. What am I? | Card: 33 / 48 |
| Insertion Sort | Card: 34 / 48 |
| What is the time complexity of heap sort? | Card: 35 / 48 |
| O(n log n) | Card: 36 / 48 |
| Fill in the blank: A ______ is a complete binary tree where each node's value is greater than or equal to its children. | Card: 37 / 48 |
| Max heap | Card: 38 / 48 |
| True or False: Radix sort is a comparison-based sorting algorithm. | Card: 39 / 48 |
| False. Radix sort is not comparison-based. | Card: 40 / 48 |
| What is the main advantage of radix sort over comparison-based algorithms? | Card: 41 / 48 |
| It can sort numbers in linear time O(n) under certain conditions. | Card: 42 / 48 |
| Riddle: I sort but require a stable base to do my work, shifting digits from least to most. What am I? | Card: 43 / 48 |
| Radix Sort | Card: 44 / 48 |
| What is the primary function of the merge() in merge sort? | Card: 45 / 48 |
| To combine two sorted halves into a single sorted array. | Card: 46 / 48 |
| What is the time complexity of linear search in the worst case? | Card: 47 / 48 |
| O(n) | Card: 48 / 48 |
| Completed! Keep practicing to master all of them. |  Restart |
