Problems Base course RU

Found in

version control

Articles

SRT Algorithm Binary search Finds the “no → yes” boundary in ordered data in log₂ n checks. O(log n) 2 problems SRT Algorithm Counting sort and radix sort Without comparisons: count the keys or split them into digits, O(n + k) and O(d·n) instead of n log n. O(n + k) and O(d·(n + b)) 2 problems

Often together

array 2 classic 2 interviews 2 searching 1 binary search 1 sorting 1 stable 1 prefix sums 1 bit tricks 1 trie 1 in production 1