Randomised algorithms
Randomised algorithms are built on statistical features played by random numbers.Quicksort is a good example to illustrate this algorithm. For instance, in a class of taller students would naturally go at the back and smaller people in size at the front. That is the idea of quick sort. In this case we call it quick because a student can easily realise where his position…See More
Comment Wall
You need to be a member of Data Science Central to add comments!
Join Data Science Central