Test: Computer Science


Which of the following statements explains insertion sort?

All numbers less than the average are inserted on the left, and the rest is inserted at the right. The process is then repeated for the left and right side until all numbers are sorted.

The list is iterated through multiple times until it finds the desired first number, then repeats the process for all numbers.

The list is broken apart into smaller lists that are sorted and merged back together.

It removes one element from the list, finds where it should be located, and inserts it in that position until no more elements remain.

None of these are insertion sort.

1/2 questions


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