Problems Base course RU

Method

stable

Articles

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

sorting 1 array 1 prefix sums 1 bit tricks 1 trie 1 version control 1 classic 1 interviews 1 in production 1