Computer Algorithms Challenge

What is the time complexity of Bubble Sort in the worst case?

• O(n log n)

• O(n^2)

• O(log n)

• O(n)

Name one advantage of Quick Sort over Merge Sort.

• Less memory usage due to in-place sorting.

• Stable sorting algorithm.

• Better performance on large datasets than Merge Sort.

• Faster average case performance than Merge Sort.

What algorithm would you use to find the shortest path in a graph?

• A* algorithm

• Floyd-Warshall algorithm

• Bellman-Ford algorithm

• Dijkstra's algorithm

Explain the difference between linear search and binary search.

• Linear search is O(n) in time complexity, while binary search is O(log n), making binary search faster for sorted lists.

• Binary search can be used on unsorted lists.

• Linear search has a time complexity of O(log n).

• Linear search is faster than binary search for large datasets.

What is the time complexity of Depth-First Search (DFS) in a graph?

• O(V)

• O(V + E)

• O(E)

• O(V * E)

Which sorting algorithm is based on the divide and conquer strategy?

• Selection Sort

• Insertion Sort

• Merge Sort

• Bubble Sort

What is the primary use of Dijkstra's algorithm?

• To find the shortest path in a graph.

• To calculate the maximum flow in a network.

• To determine the minimum spanning tree of a graph.

• To sort the nodes in a graph.

How does Merge Sort achieve its efficiency?

• Merge Sort is based on a random sampling method for sorting.

• Merge Sort uses a linear approach with O(n) time complexity.

• Merge Sort relies on a single-pass algorithm for efficiency.

• Merge Sort is efficient due to its divide-and-conquer strategy, achieving O(n log n) time complexity.

What is the best-case time complexity of Insertion Sort?

• O(1)

• O(n)

• O(n log n)

• O(n^2)

What data structure is commonly used to implement a Breadth-First Search (BFS)?

• Queue

• Stack

• Binary Tree

• Linked List