Sorting Algorithms Quiz

What is the initial number used in the sorting example provided in the text?

• 239

• 307

• 214

• 223

What is the relationship between input size and the number of steps in the Selection Sort algorithm?

• Linear

• Quadratic

• Logarithmic

• Exponential

What does the "N" in the complexity of merge sort represent?

• The number of merge steps

• The number of items in the array

• The number of comparisons

• The number of splits

What does the "Log N" in the complexity of merge sort represent?

• The number of items in the array

• The number of merge steps

• The number of comparisons

• The number of splits

What is the result after merging all numbers in merge sort?

• The array is partially sorted

• The array is fully sorted

• The array is unsorted

• The array is doubled in size

What is the main problem with the N squared complexity mentioned in the text?

• It is too fast

• It is not efficient for large arrays

• It is only suitable for small arrays

• It is too complex to implement

What is the purpose of labeling lines in a graph with weights?

• To identify the nodes.

• To determine the shortest path.

• To indicate the cost or weight of travel.

• To sort the nodes alphabetically.

What is the brute force approach in finding the shortest path in a graph?

• Using Dijkstra's algorithm.

• Trying every single path exhaustively.

• Sorting the nodes by weight.

• Using a map to find the shortest route.

What is the cost to reach The Trident from Highgarden in the example?

• 5

• 8

• 12

• 13

What is the total cost to reach Riverrun from Highgarden?

• 10

• 25

• 33

• 14