Algorithms

Question 1

Big O notation

Answer 1

Constant:O(1)
Logarithms:O(log n)
Liner:O(n)
Polynomial:O(n^k)
Exponential:O(k^n)

Question 2

Dijkstra’s algorithm

Answer 2

Finds the shortest path between two points

Question 3

How does insertion sort work?

Answer 3

sorted list and unsorted listed

the first item from the unsorted list is compared to the first item from the unsorted listed.

Question 4

How does bubble sort work?

Answer 4

worst case:O(n^2(squared))
Initial unsorted array
1)Compare first and second if necessary swap
2)compare second and third if necessary swap
3)continue till u reach the end of an array
4)repeat the steps 1-3

Question 5

How does Linear search work?

Answer 5

The linear search involves methodologically searching one location after another until the searched-for value is found. Starts at the beginning

Question 6

How does binary search work?

Answer 6

Binary search works by dividing the list into two each time until the item being searched for is found. For binary search to work, the list has to be in order

Question 7

How does quick sort work?

Answer 7

bn