Kaudzes algoritms tiek izmantots, lai ģenerētu visas N objektu permutācijas. Ideja ir ģenerēt katru permutāciju no iepriekšējās permutācijas, izvēloties apmaiņas elementu pāri, netraucējot otru n-2 elementi.
Tālāk ir parādīts visu N doto skaitļu permutāciju ģenerēšana.
Piemērs:
Input: 1 2 3 Output: 1 2 3 2 1 3 3 1 2 1 3 2 2 3 1 3 2 1
Algoritms:
- Algoritms ģenerē (N-1)! Pirmo N-1 elementu permutācijas, kas atrodas blakus pēdējam elementam katram no šiem. Tas radīs visas permutācijas, kas beidzas ar pēdējo elementu.
- Ja n ir nepāra apmainiet pirmo un pēdējo elementu un ja n pat tad nomainiet ithElements (I ir skaitītājs, kas sākas no 0) un pēdējais elements un atkārtojiet iepriekš minēto algoritmu, līdz i ir mazāks par n.
- Katrā iterācijā algoritms radīs visas permutācijas, kas beidzas ar pašreizējo pēdējo elementu.
Ieviešana:
C++// C++ program to print all permutations using // Heap's algorithm #include
// Java program to print all permutations using // Heap's algorithm import java.io.*; class HeapAlgo { // Prints the array void printArr(int a[] int n) { for (int i = 0; i < n; i++) System.out.print(a[i] + ' '); System.out.println(); } // Generating permutation using Heap Algorithm void heapPermutation(int a[] int size int n) { // if size becomes 1 then prints the obtained // permutation if (size == 1) printArr(a n); for (int i = 0; i < size; i++) { heapPermutation(a size - 1 n); // if size is odd swap 0th i.e (first) and // (size-1)th i.e (last) element if (size % 2 == 1) { int temp = a[0]; a[0] = a[size - 1]; a[size - 1] = temp; } // If size is even swap ith // and (size-1)th i.e last element else { int temp = a[i]; a[i] = a[size - 1]; a[size - 1] = temp; } } } // Driver code public static void main(String args[]) { HeapAlgo obj = new HeapAlgo(); int a[] = { 1 2 3 }; obj.heapPermutation(a a.length a.length); } } // This code has been contributed by Amit Khandelwal.
# Python program to print all permutations using # Heap's algorithm # Generating permutation using Heap Algorithm def heapPermutation(a size): # if size becomes 1 then prints the obtained # permutation if size == 1: print(a) return for i in range(size): heapPermutation(a size-1) # if size is odd swap 0th i.e (first) # and (size-1)th i.e (last) element # else If size is even swap ith # and (size-1)th i.e (last) element if size & 1: a[0] a[size-1] = a[size-1] a[0] else: a[i] a[size-1] = a[size-1] a[i] # Driver code a = [1 2 3] n = len(a) heapPermutation(a n) # This code is contributed by ankush_953 # This code was cleaned up to by more pythonic by glubs9
// C# program to print all permutations using // Heap's algorithm using System; public class GFG { // Prints the array static void printArr(int[] a int n) { for (int i = 0; i < n; i++) Console.Write(a[i] + ' '); Console.WriteLine(); } // Generating permutation using Heap Algorithm static void heapPermutation(int[] a int size int n) { // if size becomes 1 then prints the obtained // permutation if (size == 1) printArr(a n); for (int i = 0; i < size; i++) { heapPermutation(a size - 1 n); // if size is odd swap 0th i.e (first) and // (size-1)th i.e (last) element if (size % 2 == 1) { int temp = a[0]; a[0] = a[size - 1]; a[size - 1] = temp; } // If size is even swap ith and // (size-1)th i.e (last) element else { int temp = a[i]; a[i] = a[size - 1]; a[size - 1] = temp; } } } // Driver code public static void Main() { int[] a = { 1 2 3 }; heapPermutation(a a.Length a.Length); } } /* This Java code is contributed by 29AjayKumar*/
<script> // JavaScript program to print all permutations using // Heap's algorithm // Prints the array function printArr(an) { document.write(a.join(' ')+'
'); } // Generating permutation using Heap Algorithm function heapPermutation(asizen) { // if size becomes 1 then prints the obtained // permutation if (size == 1) printArr(a n); for (let i = 0; i < size; i++) { heapPermutation(a size - 1 n); // if size is odd swap 0th i.e (first) and // (size-1)th i.e (last) element if (size % 2 == 1) { let temp = a[0]; a[0] = a[size - 1]; a[size - 1] = temp; } // If size is even swap ith // and (size-1)th i.e last element else { let temp = a[i]; a[i] = a[size - 1]; a[size - 1] = temp; } } } // Driver code let a=[1 2 3]; heapPermutation(a a.length a.length); // This code is contributed by rag2127 </script>
Izvade
1 2 3 2 1 3 3 1 2 1 3 2 2 3 1 3 2 1
Laika sarežģītība: O (n*n!), Kur n ir dotā masīva lielums.
Papildu telpa: O (n) Rekursīvai kaudzes telpai N.
Atsauces:
1. 'https://en.wikipedia.org/wiki/heap%27S_Algorithm#cite_note-3