Suhendry Effendy - VisuAlgo remains the exclusive platform for visualizing and animating several of these complex algorithms even after a decade. Steven Halim's book, 'Competitive Programming' - co-authored with Dr. Initially conceived in 2011 by Associate Professor Steven Halim, VisuAlgo aimed to facilitate a deeper understanding of data structures and algorithms for his students by providing a self-paced, interactive learning platform.įeaturing numerous advanced algorithms discussed in Dr. The version presented in CLRS is stable, but is a bit more complex than this form. PS: This version of Counting Sort is not stable, as it does not actually remember the (input) ordering of duplicate integers. We will not be able to do the counting part of Counting Sort when k is relatively big due to memory limitation, as we need to store frequencies of those k integers. The time complexity of Counting Sort is thus O( N+k), which is O( N) if k is small. The time complexity is O( N) to count the frequencies and O( N+k) to print out the output in sorted order where k is the range of the input Integers, which is 9-1+1 = 9 in this example. , Integer 9 appears, and then loop through 1 to 9 to print out x copies of Integer y if frequency = x. Try Counting Sort on the example array above where all Integers are within, thus we just need to count how many times Integer 1 appears, Integer 2 appears. Assumption: If the items to be sorted are Integers with small range, we can count the frequency of occurrence of each Integer (in that small range) and then loop through that small range to output the items in sorted order.

Pivot animator figure