QUIZ 2

Which sorting algorithm selects the smallest element from the unsorted part and places it in the correct position?

• Insertion Sort

• Selection Sort

• Merge Sort

• Quick Sort

Which sorting algorithm repeatedly compares adjacent elements and swaps them if needed?

• Bubble Sort

• Selection Sort

• Insertion Sort

• Heap Sort

What is the worst-case time complexity of Selection Sort and Bubble Sort?

• O(n)

• O(log n)

• O(n log n)

• O(n²)

Which search technique scans elements one by one until the target is found?

• Binary Search

• Hashing

• Sequential Search

• Indexing

If the pattern length is m and text length is n, the brute force string matching has time complexity:

• O(n + m)

• O(log n)

• O(m²)

• O((n - m + 1) * m)