Fast exponentiation is an algorithm that allows you to raise any number to a natural power for a reduced number of multiplications.
Read more...Levenshtein distance (editorial distance, editing distance) - the minimum number of operations of deleting, inserting and replacing a character necessary to convert one line to another.
Read more...Merge sort - an array sorting algorithm that is implemented on the principle of “divide and conquer”. The task of sorting an array is divided into several sub-tasks of sorting arrays of smaller size, after which the result is combined, which leads to the solution of the initial problem.
Read more...Quick sort or Hoar sort is one of the fastest data sorting algorithms.
Read more...Selection sort – an array sorting algorithm that is comparable in speed with bubble sorting.
Read more...Stooge sort (sorting by parts) – a recursive array sorting algorithm.
Read more...