statistics algorithms


  • josephus problem

    In computer science and mathematics, the Josephus Problem (or Josephus permutation) is a theoretical problem related to a certain counting-out game.People are standing in a circle waiting to be executed. Counting begins at a specified point in the ...

  • kmeans clustering

    k-means clustering is a method of vector quantization, originally from signal processing, that is popular for cluster analysis in data mining. k-means clustering aims to partition n observations into k clusters in which each observation belongs to the ...

  • stat mode

    Stathmodera flavescens is a species of beetle in the family Cerambycidae. It was described by Breuning in 1940. https://en.wikipedia.org/wiki/Stathmodera_flavescens

  • stooge sort

    Stooge sort is a recursive sorting algorithm with a time complexity of O(nlog 3 / log 1.5 ) = O(n2.7095...). The running time of the algorithm is thus slower compared to efficient sorting algorithms, such as Merge sort, and is even slower than Bubble ...