Question Info

This question is public and is used in 8 tests or worksheets.

Type: Multiple-Choice
Category: Programming
Level: Grade 11
Tags: Problem Solving, Computer Science
Author: JenniferCrump
Created: 4 years ago

View all questions by JenniferCrump.

Programming Question

View this question.

Add this question to a group or test by clicking the appropriate button below.

Grade 11 Programming

The algorithm divides the input list into two parts: the sublist of items already sorted, which is built up from left to right at the front (left) of the list, and the sublist of items remaining to be sorted that occupy the rest of the list. Initially, the sorted sublist is empty and the unsorted sublist is the entire input list. The algorithm proceeds by finding the smallest (or largest, depending on sorting order) element in the unsorted sublist, exchanging (swapping) it with the leftmost unsorted element (putting it in sorted order), and moving the sublist boundaries one element to the right.
  1. Binary Search Algorithm
  2. Bubble Sort
  3. Insertion Sort
  4. Linear Search Algorithm
  5. Merge Sort
  6. Quick Sort
  7. Selection Sort
You need to have at least 5 reputation to vote a question down. Learn How To Earn Badges.