I was reviewing the big O cheatsheet at http://bigocheatsheet.com/ and ran into some listings under sort that I do not understand.
Runtimes are color coded, green being better than yellow. There are cases where Ω(N) is color coded better than Ω(N+K) and even Ω(NK). An example is bubble sort best case vs counting sort best case.
Assuming these are not mislabeled, can someone please explain why Ω(N+K) is better than Ω(N)?