Algorthims

Question 1

Order of speed of Big O

Answer 1

Fastest to Slowest

Log(n), n, n^2, 2^n, n!

Question 2

Bubble Sort

Answer 2

Best: n
Average: n^2
Worst: n^2

Stable

1st loop: runs through list i=0 to length-1
2nd loop (inside): runs through list j=0 to length-i-2
Code (inside): If list(j) is greater than list(j+1)
Code(inside): swap numbers

Question 3

Insertion Sort

Answer 3

Best: n
Average: n^2
Worst: n^2

Stable

2 loops
Runs through list from index = 1 to length -1
Finds value and stores index in new variable
While variable is bigger than 0 and value behind value is greater that value
Swap
End loop
Old variable into new variable position

(Does not Sort first value in list)

Question 4

Merge Sort

Answer 4

Best: n log n
Average: n log n
Worst: n log n

Divide and conquer
Stable

Question 5

Quick Sort

Answer 5

Best: n log n
Average: n log n
Worst: n^2 (pivot is bad)

Divide and conquer 
Fast, good for large data
Effective use of caching
But complicated 
Not stable

Question 6

Dijkstras Shortest Path

Answer 6

Shortest distance between 1 node and all other nodes

Question 7

A* algorithm

Answer 7

Find shortest path between 1 node and another

Uses heuristics

Question 8

Linear Search

Answer 8

Search through items one by one until found
O(n)
Unsorted

Question 9

Binary Search

Answer 9

Divide and conquer
Sorted
O(log n)