Test: Computer Science

1.

How is merge sort accomplished?

The original list is broken into two groups, then sorted from there.

The original list is continuously broken up into sublists until each sublist is containts 1 element, then the sublists are combined together.

Each element in the list is compared to all the other elements and inserted where it fits.

If there are an even number of elements, the list is broken into two groups, are sorted, then merged back together. If there are odd numbered elements, the list is broken into three groups.

The orginal list is broken into sublists of 4, then are combined together.

1/2 questions

0%

Access results and powerful study features!

Take 15 seconds to create an account.
Start now! Create your free account and get access to features like:
  • Full length diagnostic tests
  • Invite your friends
  • Access hundreds of practice tests
  • Monitor your progress over time
  • Manage your tests and results
  • Monitor the progress of your class & students
By clicking Create Account you agree that you are at least 13 years old and you agree to the Varsity Tutors LLC Terms of Use and Privacy Policy.
Learning Tools by Varsity Tutors