Next-permutation algorithm (Narayana Pandita)
Algoritmo de la siguiente permutación (Narayana Pandita)
- Date
- 1356 · confidence high
- Place
- Northern India, India
- Credited to
- Narayana Pandita
- People
- 👤 Naraian Pandit1340–1400
- Field
- Knowledge & symbols
What was discovered
The Ganita Kaumudi gives a procedure for generating all permutations in lexicographic order, moving from each to the next, and general methods for constructing magic squares. It is the same algorithm used in programming today.
Knuth acknowledges it in The Art of Computer Programming; Narayana's place of work is unknown.
What it led to
- algorithmic combinatorics
- systematic construction of magic squares