Data

Question 1

Topological Sort

Answer 1

topological

Question 2

Recursive Function

Answer 2

Will call it's self automatically or on demand
MUST HAVE BREAK VALUE
i.e. factorial(n-l, n*accumulator) {
if (n===0) {
return accumulator }
{
return factorial(n — 1, n * accumulator)
}
factorial(5, 1) //==>> 120

Question 3

Merge Sort

Answer 3

Divide and sort
O(nLogn)
Fast but requires space

Question 4

Quick sort

Answer 4

Pick a pivot and move items: smaller (left), larger (right)
Repeat
Normally O(n*logN)
Worst case O(N2)

Question 5

Bubble Sort

Answer 5

Swaps 2 and moves

typically impractical

Question 6

Binary Search

Answer 6

find the midpoint and determine if >=, <=, or =
Then repeat
MUST BE SORTED
O(LogN)

Question 7

Depth First Search

Answer 7

Goes DEEP first
Starts by searching down one side of the path
Must have VISITED FLAG

Question 8

Breadth First Search

Answer 8

Starts by searching all children before going down

Create a queue and then check

Question 9

Insertion Sort

Answer 9

starting index, sort everything to the left, then move over. Repeat.
O(N)

Question 10

Heap Sort

Answer 10

Create a tree, swap parents to find the largest, remove and repeat. Sorts in ascending order
Always n(LogN)