First Algorithm Written In Nuru!

[AvicennaJr]

Heap's Algorithm in Nuru

An algorithm to print all permutations. Practically the first algorithm ever written in Nuru.

Written by: Don VKariuki

 // NURU program to print all permutations using // Heap's algorithm // function is even or odd acha isEven = fn(a) { rudisha ((a / 2) + (a / 2) == a) } acha HeapPermutation = fn(a, size) { acha i = 0 acha j = size - 1 // if size becomes 1 then prints the obtained // permutation kama (size == 1) { andika(a) } wakati (i < size) { HeapPermutation(a, j) // if size is odd, swap first and last // element kama (isEven(size)) { acha temp = a[i] a[i] = a[j] a[j] = temp } sivyo { acha temp = a[0] a[0] = a[j] a[j] = temp } i = i + 1 } } HeapPermutation([1, 2, 3, 4], 4) 

[pythontzgroup]

Pretty neat