Chapter 6 : Sorting and Searching

What is the main purpose of sorting in computer science?

• To perform arithmetic operations

• To store data in memory

• To arrange data in a specific order

• To compress data

Which of the following sorting algorithms repeatedly finds the smallest element from an unsorted part of the list and places it at the beginning?

• Insertion Sort

• Selection Sort

• Merge Sort

• Quick Sort

In which sorting algorithm is the data divided into smaller sub-arrays that are sorted individually and then merged?

• Bubble Sort

• Selection Sort

• Insertion Sort

• Merge Sort

Which sorting method is most efficient for a small, nearly sorted array?

• Bubble Sort

• Insertion Sort

• Selection Sort

• Quick Sort

In Quick Sort, what is the process of selecting an element and rearranging the array around it called?

• Merging

• Partitioning

• Insertion

• Swapping

Which sorting algorithm works by repeatedly swapping adjacent elements if they are in the wrong order?

• Bubble Sort

• Selection Sort

• Quick Sort

• Merge Sort

When should Merge Sort be preferred over Quick Sort?

• When the list is large and requires guaranteed O(nlog⁡n)O(n \log n)O(nlogn) performance

• When the list is small and nearly sorted

• When in-place sorting is required

• When the list contains duplicate values

What is the main difference between Linear Search and Binary Search?

• Linear Search works on unsorted data, while Binary Search requires sorted data

• Binary Search works on unsorted data, while Linear Search requires sorted data

• Both searches require the data to be sorted

• Both searches require the data to be unsorted

In a Linear Search, how many comparisons are made in the worst case to find an element in an array of size nnn?

• O(1)O(1)O(1)

• O(log⁡n)O(\log n)O(logn)

• O(n)O(n)O(n)

• O(nlog⁡n)O(n \log n)O(nlogn)

Which of the following searching algorithms follows the "divide and conquer" approach?

• Linear Search

• Selection Sort

• Binary Search

• Bubble Sort