Introduction to Algorithms Quiz

What is an algorithm?

• A programming language

• A type of computer hardware

• A well-defined computational procedure

• A random sequence of operations

What does the efficiency of an algorithm refer to?

• The amount of memory it uses

• The speed at which it runs

• The resources of time and space it uses

• The complexity of its code

Which sorting algorithm typically runs faster for small input sizes?

• Insertion sort

• Bubble sort

• Quick sort

• Merge sort

What is the worst-case running time of insertion sort?

• O(n)

• O(n log n)

• O(n^2)

• O(log n)

In the RAM model, what does each instruction or data access take?

• An infinite amount of time

• No time at all

• A constant amount of time

• A variable amount of time

What is the primary operation of the merge sort algorithm?

• Dividing the array into two halves

• Finding the maximum element

• Sorting the array in place

• Merging two sorted subarrays

What does the term 'order of growth' refer to?

• The total number of operations

• The efficiency of the hardware

• The rate at which the running time increases

• The size of the input data

What is the best-case scenario for insertion sort?

• The array is in reverse order

• The array contains duplicate values

• The array is already sorted

• The array is randomly ordered

What is the main advantage of using the divide-and-conquer method?

• It eliminates the need for recursion

• It reduces the running time significantly

• It guarantees a correct solution

• It simplifies the code

What is the time complexity of the merge operation in merge sort?

• O(n)

• O(1)

• O(log n)

• O(n^2)