{"id":2085,"date":"2020-06-12T12:00:11","date_gmt":"2020-06-12T12:00:11","guid":{"rendered":"https:\/\/blog.prepbytes.com\/?p=2085"},"modified":"2022-03-22T09:47:52","modified_gmt":"2022-03-22T09:47:52","slug":"possible-attack-1","status":"publish","type":"post","link":"https:\/\/prepbytes.com\/blog\/possible-attack-1\/","title":{"rendered":"Possible Attack-1"},"content":{"rendered":"

\"\"<\/p>\n

Concepts Used<\/h3>\n
\n

Back Tracking<\/p>\n<\/blockquote>\n

Difficulty Level<\/h3>\n
\n

Medium<\/p>\n<\/blockquote>\n

Problem Statement :<\/h3>\n
\n

Given N<\/code> integers print all possible combinations.<\/p>\n<\/blockquote>\n

<\/strong><\/u><\/a><\/p>\n

Solution Approach :<\/h3>\n

Introduction :<\/h4>\n
\n

Idea is to swap all the values one-by-one and print all different combinations. In a set of n<\/code> elements there are n!<\/code> different permutations. For example, there are six permutations of the set {1,2,3}, namely (1,2,3), (1,3,2), (2,1,3), (2,3,1), (3,1,2), and (3,2,1).<\/p>\n<\/blockquote>\n

\"\"<\/p>\n

Description :<\/h4>\n
\n

We need to explore all the possible combinations which can be solved with backtracking<\/strong>.<\/p>\n

Backtracking<\/strong> is the approach to solve the problem by testing all possible combinations. If any subproblem does not fit the given constraint then we discard the complete subproblem (backtrack), moves a step back then try other remaining possible combinations. Backtracking algorithm is generally exponential in time.<\/p>\n<\/blockquote>\n

We will swap every index of the array and then break our problem into subproblems, by recursively calling our function for the next index, when the index becomes equal to the size of the array we print the current combination, every time we swap indices we make sure to revert the changes by swapping them back again to try another combinations (backtrack).<\/p>\n

Algorithm :<\/h4>\n

backtrack()<\/strong> :<\/p>\n

    \n
  1. If index == n<\/code>, print the current combination.<\/li>\n
  2. else, for every k= index<\/code> to n-1<\/code> :
    \n
    \n
      \n
    • swap(index,k)<\/li>\n
    • call backtrack(arr,index+1,n)<\/li>\n
    • swap(index,k) , (Backtrack step).<\/li>\n<\/ul>\n<\/blockquote>\n<\/li>\n<\/ol>\n

      Complexity Analysis :<\/h3>\n
      \n

      Total number of permutations are, as discussed earlier, n!<\/code>, and it takes O(n)<\/code> time to print each permutation. Can you guess the final time complexity<\/strong>?<\/p>\n<\/blockquote>\n

      Solutions:<\/h3>\n\t\t\t\t\t\t