test for Big O, sorting and searching

Question 1

complexity is

Answer 1

the amount of time and space that an algorithm requires to be executed

Question 2

what is an example of a logarithmic complexity

Answer 2

binary search

Question 3

what is an exmaple of an algorithm with pylonomial complexity O (n^2)

Answer 3

bubble sort, insertion sort

Question 4

what is the time complexity of a recursive algorithm

Answer 4

Exponential O(2^n)

Question 5

what is the best time complexity for all the search algorithms

Answer 5

O(1)

Question 6

what is the worst time complexity for a quick sort

Answer 6

O(n^2)

Question 7

what is the worst time complexity for hashing

Answer 7

O(n)

Question 8

what is the best and the average / worst time complexity for insertion and bubble sort

Answer 8

best : O(n)
worst/average: O(n^2)

Question 9

what is heuristics

Answer 9

it estimates the shortest path from the start node.
it is used to improve efficiency as it prioritises nodes that are likely to lead to the shortest path

Question 10

what is the difference between A* and dijkstras

Answer 10

D explores all the nodes in a graph, finding the shortest path without considering heuristics
A* uses heuristics to prioritize nodes with the lowest estimated cost, improving efficiency