File tree Expand file tree Collapse file tree 1 file changed +6
-6
lines changed Expand file tree Collapse file tree 1 file changed +6
-6
lines changed Original file line number Diff line number Diff line change @@ -11,14 +11,14 @@ The algorithm is the most important part of any program.
11
11
- Bubble sort ___ (Time complexity = О(n<sup >2</sup >))___
12
12
- Insertion Sort ___ (Time complexity = О(n<sup >2</sup >))___
13
13
- Selection Sort ___ (Time complexity = О(n<sup >2</sup >))___
14
- - Quick sort ___ (Time complexity = О(n * log(n) )___
15
- - Merge sort ___ (Time complexity = О(n * log(n) )___
14
+ - Quick sort ___ (Time complexity = О(log< sub >2</ sub >n )___
15
+ - Merge sort ___ (Time complexity = О(log< sub >2</ sub >n )___
16
16
17
17
- Binary Search
18
- - Binary search on Sorted array
19
- - Binary search in infinite sorted array (constant speed)
20
- - Binary search in infinite sorted array (exponential speed)
21
- - Binary search on rotated sorted Array
18
+ - Binary search on Sorted array ___ (Time complexity = О(log< sub >2</ sub >n) ___
19
+ - Binary search in infinite sorted array (constant speed) ___ (Time complexity = О(log< sub >2</ sub >n) ___
20
+ - Binary search in infinite sorted array (exponential speed) ___ (Time complexity = О(log< sub >2</ sub >n) ___
21
+ - Binary search on rotated sorted Array ___ (Time complexity = О(log< sub >2</ sub >n) ___
22
22
23
23
- Backtraking
24
24
- Sudoku solver ___ (Time complexity = О(9<sup >n</sup >))___
You can’t perform that action at this time.
0 commit comments