Comparison Counting Sort

But in fact it isn’t Bubble Sort that emerges as the single best algorithms in the face of a noisy comparator. The winner of that particular honor is an algorithm called Comparison Counting Sort 202006110147. In this algorithm, each item is compared to a ll the others, generating a tally of how many items it is bigger than. This number can then be used directly as the item’s rank. Since it compares all pairs, Comparison Counting Sort is a quadratic-time algorithm, like Bubble Sort. Thus it’s not a popular choice in traditional computer science applications, but it’s exceptionally fault-tolerant.

Pretty cool how the round-robin format is the most fault-tolerant sorting algorithm.

Created from: Book review: Algorithms to Live By 202005302204

uid: 202006110147 tags: #algorithms

Date

February 22, 2023

Up next

Goals For 2020 Now that I’ve been given a lot of the opportunities I’ve wanted for a while (TA, internship, research), utilize those opportunities to the best of

Previously

Obsidian Even though it’s full-featured, doesn’t feel as smooth, as native, as the Archive does. Doesn’t have in-app links like the Archive 202207051453 does