Exam 12: Sorting Data

The insertion sort algorithm builds a sorted array one element at a time.

Sorting an array of data elements involves moving them around.

In a(n) ____, the number of comparisons made in each pass is one less than the number of elements remaining to be sorted because an element must be compared with the element next to it.

The following algorithm represents the logic of a(n) ____. For maxElement = ARRAYSIZE - 1 To 1 Step - 1 For index = 0 To maxElement - 1 If someNums[index] > someNums[index + 1] Then Temp = someNums[index] SomeNums[index] = someNums[index + 1] SomeNums[index + 1] = temp End If End For End For

The programming logic for a bubble sort requires two loops: an outer loop for each pass through the array and an inner loop to compare elements during a pass.

You can make an ascending bubble sort move the smallest value to the leftmost location first, and then work toward the right of the array.

When sorting a selection sort in ascending order, the array is scanned for the smallest value on the first pass, and when its position is determined, it is swapped with the element at subscript [0].

The selection sort uses a nested While loop to compare and swap elements because an element is not placed until its correct position is determined.

A bubble sort is more efficient than a selection sort because only one swap is made in each pass.

A(n) ____ finds which element belongs in a particular position on each pass through the array and moves it there.

A(n) ____ builds a sorted array by determining where each element should be in the sorted part of the array and inserting it in that position while moving all other sorted elements over one position.

All sorting algorithms use an outer For loop to go through an array.

To reverse the order of array elements, you use the JavaScript method ____.

A(n) ____ is the most straightforward sorting algorithm but often the least efficient.

The sort() method arranges array elements in descending order.

A(n) ____ involves comparing adjacent elements and swapping them, if needed, until all elements are in their correct positions.

Sorting is often done on arrays because sorted array elements can be referenced in memory and moved around more easily.

Putting data items in order is called ____.

Which of the following swaps the values of someNums[0] and someNums[1], which currently contain the values 8 and 3, respectively?

Data in data structures, such as linked lists and binary trees, cannot be sorted.