algorithms

Question 1

Define linear search

Answer 1

A sequence that checks every item in a list 1 by 1 until it finds the desired item.

Question 2

Define bubble sort

Answer 2

Bubble sort makes multiple passes through a list. It compares items and changes those that are out of order. Each pass through the list places the next largest value in its proper place.

Question 3

Define binary search

Answer 3

A sequence that finds the desired item of a list according to the midpoints.

Question 4

Define insertion sort

Answer 4

A more efficient version of bubble sort. Each pass would insert each number into its correct place.

Question 5

How are numbers sorted in insertion sort?

Answer 5

Compares 1st 2 items and inserts the necessary item into its complete correct position rather than swapping them. Has 2 lists, unsorted and sorted.