Searching and Sorting Algorithms Quiz

What is the time complexity of a linear search algorithm?

• O(n)

• O(n^2)

• O(log n)

• O(1)

Which search algorithm requires the array to be sorted before performing the search?

• Breadth First Search

• Depth First Search

• Binary Search

• Linear Search

What is the worst-case time complexity of a binary search algorithm?

• O(log n)

• O(1)

• O(n^2)

• O(n)

Which sorting algorithm repeatedly swaps adjacent elements if they are in the wrong order?

• Selection Sort

• Bubble Sort

• Insertion Sort

• Merge Sort

What is the time complexity of a bubble sort algorithm in the worst case?

• O(1)

• O(log n)

• O(n)

• O(n^2)

Which sorting algorithm repeatedly selects the minimum element from the unsorted part of the array and places it at the beginning?

• Selection Sort

• Merge Sort

• Insertion Sort

• Bubble Sort

What is the time complexity of a selection sort algorithm in the worst case?

• O(n^2)

• O(n log n)

• O(log n)

• O(n)

Which sorting algorithm builds the final sorted array one item at a time by inserting each item into its proper place?

• Bubble Sort

• Selection Sort

• Merge Sort

• Insertion Sort

What is the time complexity of an insertion sort algorithm in the worst case?

• O(n^2)

• O(1)

• O(log n)

• O(n)

Which sorting algorithm is considered efficient for small data sets or partially sorted arrays?

• Insertion Sort

• Merge Sort

• Selection Sort

• Bubble Sort