Divide & Conquer
O(n*logn)
Which algorithm has this time complexity?
decrease by a constant factor example
Binary search is an example of?
single source shortest path problems
Dijkstra’s algorithm is used to solve __________ problems?
boolean value
The Bellmann Ford Algorithm returns __________ value?
Backtracking
Which of the following is used for solving the N Queens Problem?
Rabin Karp Algorithm
Which of the following algorithms are used for string and pattern matching problems?
Mergesort
Which of the following sorting algorithms has the lowest worst-case complexity?
fractional knapsack
is an example of greedy method
backtracking
N-queens based on?
O(n log n)
average case time complexity of quicksort