top button
Flag Notify
    Connect to us
      Site Registration

Site Registration

Print all permutations of a string and share the complexity of the algorithm?

+3 votes
Print all permutations of a string and share the complexity of the algorithm?
posted Oct 14, 2015 by anonymous

Share this question
Facebook Share Button Twitter Share Button LinkedIn Share Button

1 Answer

0 votes

A permutation, also called an “arrangement number” or “order,” is a rearrangement of the elements of an ordered list S into a one-to-one correspondence with S itself. A string of length n has n! permutation.

Below are the permutations of string ABC.

enter image description here

// C program to print all permutations with duplicates allowed

include <stdio.h>

include <string.h>

/* Function to swap values at two pointers */

void swap(char *x, char *y)
    char temp;
    temp = *x;
    *x = *y;
    *y = temp;

/* Function to print permutations of string
This function takes three parameters:
1. String
2. Starting index of the string
3. Ending index of the string. */

void permute(char *a, int l, int r)
   int i;
   if (l == r)
     printf("%s\n", a);
       for (i = l; i <= r; i++)
          swap((a+l), (a+i));
          permute(a, l+1, r);
          swap((a+l), (a+i)); //backtrack

/* Driver program to test above functions */

int main()
    char str[] = "ABC";
    int n = strlen(str);
    permute(str, 0, n-1);
    return 0;



Algorithm Paradigm: Backtracking

Time Complexity: O(n*n!)

answer Oct 15, 2015 by Mohammed Hussain
will you help me to understand backtracking over here and why we are using it?
Similar Questions
+3 votes

Say the given string is ABC

Output should be ABC ACB BAC BCA CBA CAB

+2 votes

Calculate all permutations for an array of integers.

For example: Given {3, 5, 8} - Output should be: { 3, 5, 8 }, { 3, 8, 5 }, { 5, 3, 8 }, { 5, 8, 3 }, { 8, 5, 3 }, { 8, 3, 5 }

+2 votes

Say we only know the worst case and best case complexity of an algo (Algo is not known). Is it possible to get the average case complexity?

+2 votes

Assume priority queue in Dijkstra’s algorithm is implemented using a sorted link list and graph G (V, E) is represented using adjacency matrix.

What is the time complexity of Dijkstra’s algorithm (Assume graph is connected)?

+6 votes

Looking for basic steps to analyse the algorithm.