# All Permutations

Given a string,the task is to print all the permutations of the string. A permutation is a rearrangement of the elements of an ordered list S.A string of length N has N! permutations. Example- Let the string be S=”abc”. Length of the string=3 Number of permutations=3!=6 Permutations- abc acb bac bca cab cba Algorithm- Basic […]

Continue reading →