Algorithms

  • Fast exponentiation

    Fast exponentiation is an algorithm that allows you to raise any number to a natural power for a reduced number of multiplications.

  • Levenshtein distance

    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.

  • Damerau-Levenshtein distance

    Damerau-Levenshtein distance is a metric for determining the distance between two lines. It can be defined as the minimum number of deletion, insertion, replacement, and transposition operations (permutation of two adjacent characters) needed to convert one line to another.

  • Sort algorithms

    Random sort Random sorting (Bogosort) is one of the most inefficient array sorting algorithms. Bubble sort Bubble sort (bubble sort) is one of the easiest to understand methods for sorting arrays.