Sorting & Searching Algorithms

What is the purpose of a searching algorithm?

• To write a novel

• To play music

• To cook a meal

• To locate a specific item or value within a collection of data.

Which searching algorithm has a time complexity of O(log n)?

• Binary search

• Linear search

• Depth-first search

• Breadth-first search

Fill in the blank: Linear search has a time complexity of ________.

• O(n)

• O(log n)

• O(1)

• O(n^2)

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

• O(n^2)

• O(n)

• O(1)

• O(log n)

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

• Bubble Sort

• Insertion Sort

• Quick Sort

• Merge Sort

Fill in the blank: Bubble sort has a time complexity of ________.

• O(nlogn)

• O(n)

• O(n^2)

• O(1)

What is the main advantage of merge sort over bubble sort?

• Merge sort is less stable than bubble sort

• Efficiency in terms of time complexity

• Merge sort has a higher space complexity

• Merge sort is easier to implement

Which sorting algorithm divides the array into two subarrays and then merges them back together?

• Insertion Sort

• Quick Sort

• Merge Sort

• Bubble Sort

Fill in the blank: Merge sort has a time complexity of ________.

• O(log n)

• O(n^2)

• O(n)

• O(n log n)

What is the key difference between linear search and binary search?

• Linear search checks each element sequentially, while binary search divides the list in half.

• Binary search is used for unsorted lists, while linear search is used for sorted lists.

• Linear search is more efficient than binary search.

• Linear search divides the list in half, while binary search checks each element sequentially.