Merge Sort
Sign in to Google to save your progress. Learn more
Email *
Student ID *
Student Name *
What's your colleges?
Clear selection
What is the average and worst-case time complexity of merge sort?
 *
Match the following descriptions with the correct sorting algorithm (merge sort, insertion sort, or quick sort):
 *
Insertion sort
Quick sort
Merge sort
Uses a divide and conquer approach
Compares and inserts elements one at a time
Requires additional memory to store subarrays
Has an average case time complexity of O(n log n)
Has a worst-case time complexity of O(n^2)

Given the following list of integers, show the divide steps of merge sort to sort the list in ascending order.

List: [38, 27, 43, 3, 9, 82, 10]

 *
[38], [27], [43], [3], [9], [82], [10]
[38, 27, 43], [3, 9, 82, 10]
[38, 27, 43, 3, 9, 82, 10]
[38], [27, 43], [3, 9], [82, 10]
Step 1
Step 2
Step 3
Step 4

Given the following list of integers, show the merge steps of merge sort to sort the list in ascending order.

List: [38, 27, 43, 3, 9, 82, 10]

 *
[3, 9, 10, 27, 38, 43, 82]
[27, 38], [43], [3, 9], [10, 82]
[27, 38, 43], [3, 9, 10, 82]
Step 1
Step 2
Step 3

Which of the following sorting algorithms is not stable?

*
Required
Submit
Clear form
Never submit passwords through Google Forms.
reCAPTCHA
PrivacyTerms
This content is neither created nor endorsed by Google. - Terms of Service - Privacy Policy

Does this form look suspicious? Report

Google Forms