{"id":9549,"date":"2021-09-30T12:00:04","date_gmt":"2021-09-30T06:30:04","guid":{"rendered":"https:\/\/python-programs.com\/?p=9549"},"modified":"2021-11-22T18:35:27","modified_gmt":"2021-11-22T13:05:27","slug":"python-program-to-print-all-permutations-of-a-string-in-lexicographic-order-without-recursion","status":"publish","type":"post","link":"https:\/\/python-programs.com\/python-program-to-print-all-permutations-of-a-string-in-lexicographic-order-without-recursion\/","title":{"rendered":"Python Program to Print All Permutations of a String in Lexicographic Order without Recursion"},"content":{"rendered":"<p><strong>Strings in Python:<\/strong><\/p>\n<p>Strings are simple text in programming, which might be individual letters, words, phrases, or whole sentences. Python strings have powerful text-processing capabilities, such as searching and replacing characters, cutting characters, and changing case. Empty strings are written as two quotations separated by a space. Single or double quotation marks may be used. Three quote characters can be used to easily build multi-line strings.<\/p>\n<p>Given a string ,the task is to print all the permutations of the given string in lexicographic order without using recursion in Python.<\/p>\n<p><strong>Examples:<\/strong><\/p>\n<p><strong>Example1:<\/strong><\/p>\n<p><strong>Input:<\/strong><\/p>\n<pre>given string ='hug'<\/pre>\n<p><strong>Output:<\/strong><\/p>\n<pre id=\"codeOutputPre\">printing all [ hug ] permutations :\r\nhug\r\nugh\r\nuhg\r\nghu\r\nguh\r\nhgu<\/pre>\n<p><strong>Example2:<\/strong><\/p>\n<p><strong>Input:<\/strong><\/p>\n<pre>given string ='tork'<\/pre>\n<p><strong>Output:<\/strong><\/p>\n<pre id=\"codeOutputPre\">printing all [ tork ] permutations :\r\ntork\r\ntrko\r\ntrok\r\nkort\r\nkotr\r\nkrot\r\nkrto\r\nktor\r\nktro\r\nokrt\r\noktr\r\norkt\r\nortk\r\notkr\r\notrk\r\nrkot\r\nrkto\r\nrokt\r\nrotk\r\nrtko\r\nrtok\r\ntkor\r\ntkro\r\ntokr<\/pre>\n<h2>Program to Print All Permutations of a String in Lexicographic Order without Recursion<\/h2>\n<p>Below are the ways to Print All string permutations without recursion in lexicographic order:<\/p>\n<ul>\n<li><a href=\"#Using_for_and_while_Loops(Static_Input)\">Using for and while Loops(Static Input)<\/a><\/li>\n<li><a href=\"#Using_for_and_while_Loops(User_Input)\">Using for and while Loops(User Input)<\/a><\/li>\n<\/ul>\n<p>Have you mastered basic programming topics of java and looking forward to mastering advanced topics in a java programming language? Go with these ultimate Advanced <a href=\"https:\/\/python-programs.com\/python-programming-examples-with-output\/\">java programs examples with output<\/a> &amp; achieve your goal in improving java coding skills.<\/p>\n<h3 id=\"Using_for_and_while_Loops(Static_Input)\">1)Using for and while Loops(Static Input)<\/h3>\n<p><strong>Approach:<\/strong><\/p>\n<ul>\n<li>Give the string as static input.<\/li>\n<li>The algorithm works by first generating a loop that will run n! times, where n is the length of the string.<\/li>\n<li>Each loop iteration produces the string and looks for its next variant to print in the following iteration.<\/li>\n<li>The following is the next higher permutation.<\/li>\n<li>If we call our sequence seq, we identify the least index p such that all entries in seq[p&#8230;end] are in decreasing order.<\/li>\n<li>If seq[p&#8230;end] represents the whole sequence, i.e. p == 0, then seq is the highest permutation. So we simply reverse the entire string to find the shortest permutation, which we regard to be the next permutation.<\/li>\n<li>If p &gt; 0, we reverse seq[p&#8230;end].<\/li>\n<\/ul>\n<p><strong>Below is the implementation:<\/strong><\/p>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\">from math import factorial\r\n\r\n\r\ndef printPermutationsLexico(string):\r\n    # In lexicographic sequence, print all permutations of string s.\r\n    stringseq = list(string)\r\n\r\n    # There will be n! permutations where n = len (seq).\r\n    for t in range(factorial(len(stringseq))):\r\n        # print permutation by joining all the characters using join() function\r\n        print(''.join(stringseq))\r\n\r\n        # Find p such that seq[per:] is the longest sequence with lexicographic\r\n        # elements in decreasing order.\r\n        per = len(stringseq) - 1\r\n        while per &gt; 0 and stringseq[per - 1] &gt; stringseq[per]:\r\n            per -= 1\r\n\r\n        # reverse the stringsequence from per to end using reversed function\r\n        stringseq[per:] = reversed(stringseq[per:])\r\n\r\n        if per &gt; 0:\r\n            # Find q such that seq[q] is the smallest element in seq[per:] and seq[q] is greater\r\n            # than seq[p - 1].Find q such that seq[q] is the smallest\r\n            # element in seq[per:] and seq[q] is greater than seq[per - 1].\r\n            q = per\r\n            while stringseq[per - 1] &gt; stringseq[q]:\r\n                q += 1\r\n\r\n            # swapping seq[per - 1] and seq[q]\r\n            stringseq[per - 1], stringseq[q] = stringseq[q], stringseq[per - 1]\r\n\r\n\r\n# given string as static input\r\ngiven_string = 'hug'\r\n# printing  all the perumutations\r\nprint('printing all [', given_string, '] permutations :')\r\n# passing given string to printPermutationsLexico function\r\nprintPermutationsLexico(given_string)\r\n<\/pre>\n<p><strong>Output:<\/strong><\/p>\n<pre id=\"codeOutputPre\">printing all [ hug ] permutations :\r\nhug\r\nugh\r\nuhg\r\nghu\r\nguh\r\nhgu<\/pre>\n<p><strong>Explanation:<\/strong><\/p>\n<ul>\n<li>User must give string input as static .<\/li>\n<li>On the string, the method printPermutationsLexico is called.<\/li>\n<li>The function then prints the string&#8217;s permutations in lexicographic order.<\/li>\n<\/ul>\n<h3 id=\"Using_for_and_while_Loops(User_Input)\">2)Using for and while Loops(User Input)<\/h3>\n<p><strong>Approach:<\/strong><\/p>\n<ul>\n<li>Enter some random string as user input using int(input()) function.<\/li>\n<li>The algorithm works by first generating a loop that will run n! times, where n is the length of the string.<\/li>\n<li>Each loop iteration produces the string and looks for its next variant to print in the following iteration.<\/li>\n<li>The following is the next higher permutation.<\/li>\n<li>If we call our sequence seq, we identify the least index p such that all entries in seq[p&#8230;end] are in decreasing order.<\/li>\n<li>If seq[p&#8230;end] represents the whole sequence, i.e. p == 0, then seq is the highest permutation. So we simply reverse the entire string to find the shortest permutation, which we regard to be the next permutation.<\/li>\n<li>If p &gt; 0, we reverse seq[p&#8230;end].<\/li>\n<\/ul>\n<p><strong>Below is the implementation:<\/strong><\/p>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"generic\">from math import factorial\r\n\r\n\r\ndef printPermutationsLexico(string):\r\n    # In lexicographic sequence, print all permutations of string s.\r\n    stringseq = list(string)\r\n\r\n    # There will be n! permutations where n = len (seq).\r\n    for t in range(factorial(len(stringseq))):\r\n        # print permutation by joining all the characters using join() function\r\n        print(''.join(stringseq))\r\n\r\n        # Find p such that seq[per:] is the longest sequence with lexicographic\r\n        # elements in decreasing order.\r\n        per = len(stringseq) - 1\r\n        while per &gt; 0 and stringseq[per - 1] &gt; stringseq[per]:\r\n            per -= 1\r\n\r\n        # reverse the stringsequence from per to end using reversed function\r\n        stringseq[per:] = reversed(stringseq[per:])\r\n\r\n        if per &gt; 0:\r\n            # Find q such that seq[q] is the smallest element in seq[per:] and seq[q] is greater\r\n            # than seq[p - 1].Find q such that seq[q] is the smallest\r\n            # element in seq[per:] and seq[q] is greater than seq[per - 1].\r\n            q = per\r\n            while stringseq[per - 1] &gt; stringseq[q]:\r\n                q += 1\r\n\r\n            # swapping seq[per - 1] and seq[q]\r\n            stringseq[per - 1], stringseq[q] = stringseq[q], stringseq[per - 1]\r\n\r\n\r\n# Enter some random string as user input using int(input()) function.\r\ngiven_string =input('Enter some random string = ')\r\n# printing  all the perumutations\r\nprint('printing all [', given_string, '] permutations :')\r\n# passing given string to printPermutationsLexico function\r\nprintPermutationsLexico(given_string)\r\n<\/pre>\n<p><strong>Output:<\/strong><\/p>\n<pre>Enter some random string = epic\r\nprinting all [ epic ] permutations :\r\nepic\r\nicep\r\nicpe\r\niecp\r\niepc\r\nipce\r\nipec\r\npcei\r\npcie\r\npeci\r\npeic\r\npice\r\npiec\r\nceip\r\ncepi\r\nciep\r\ncipe\r\ncpei\r\ncpie\r\necip\r\necpi\r\neicp\r\neipc\r\nepci<\/pre>\n<p><strong>Related Programs<\/strong>:<\/p>\n<ul>\n<li><a href=\"https:\/\/python-programs.com\/python-user-input-from-keyboard-input-function\/\">Python Program to Make a Simple Calculator<\/a><\/li>\n<li><a href=\"https:\/\/python-programs.com\/python-user-input-from-keyboard-input-function\/\">Python User Input from Keyboard \u2013 input() function<\/a><\/li>\n<li><a href=\"https:\/\/python-programs.com\/program-for-spell-checker-in-python\/\">Spell Checker in Python<\/a><\/li>\n<li><a href=\"https:\/\/python-programs.com\/semicolon-in-python\/\">Semicolon in Python<\/a><\/li>\n<\/ul>\n","protected":false},"excerpt":{"rendered":"<p>Strings in Python: Strings are simple text in programming, which might be individual letters, words, phrases, or whole sentences. Python strings have powerful text-processing capabilities, such as searching and replacing characters, cutting characters, and changing case. Empty strings are written as two quotations separated by a space. Single or double quotation marks may be used. &hellip;<\/p>\n<p class=\"read-more\"> <a class=\"\" href=\"https:\/\/python-programs.com\/python-program-to-print-all-permutations-of-a-string-in-lexicographic-order-without-recursion\/\"> <span class=\"screen-reader-text\">Python Program to Print All Permutations of a String in Lexicographic Order without Recursion<\/span> Read More &raquo;<\/a><\/p>\n","protected":false},"author":7,"featured_media":9554,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"spay_email":"","jetpack_publicize_message":"","jetpack_is_tweetstorm":false,"jetpack_publicize_feature_enabled":true},"categories":[5],"tags":[],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v18.9 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>Python Program to Print All Permutations of a String in Lexicographic Order without Recursion - Python Programs<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/python-programs.com\/python-program-to-print-all-permutations-of-a-string-in-lexicographic-order-without-recursion\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Python Program to Print All Permutations of a String in Lexicographic Order without Recursion - Python Programs\" \/>\n<meta property=\"og:description\" content=\"Strings in Python: Strings are simple text in programming, which might be individual letters, words, phrases, or whole sentences. Python strings have powerful text-processing capabilities, such as searching and replacing characters, cutting characters, and changing case. Empty strings are written as two quotations separated by a space. Single or double quotation marks may be used. &hellip; Python Program to Print All Permutations of a String in Lexicographic Order without Recursion Read More &raquo;\" \/>\n<meta property=\"og:url\" content=\"https:\/\/python-programs.com\/python-program-to-print-all-permutations-of-a-string-in-lexicographic-order-without-recursion\/\" \/>\n<meta property=\"og:site_name\" content=\"Python Programs\" \/>\n<meta property=\"article:publisher\" content=\"https:\/\/www.facebook.com\/btechgeeks\" \/>\n<meta property=\"article:published_time\" content=\"2021-09-30T06:30:04+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2021-11-22T13:05:27+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/python-programs.com\/wp-content\/uploads\/2021\/06\/Python-Program-to-Print-All-Permutations-of-a-String-in-Lexicographic-Order-without-Recursion.png\" \/>\n\t<meta property=\"og:image:width\" content=\"1280\" \/>\n\t<meta property=\"og:image:height\" content=\"720\" \/>\n\t<meta property=\"og:image:type\" content=\"image\/png\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:creator\" content=\"@btech_geeks\" \/>\n<meta name=\"twitter:site\" content=\"@btech_geeks\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Vikram Chiluka\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"5 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Organization\",\"@id\":\"https:\/\/python-programs.com\/#organization\",\"name\":\"BTech Geeks\",\"url\":\"https:\/\/python-programs.com\/\",\"sameAs\":[\"https:\/\/www.instagram.com\/btechgeeks\/\",\"https:\/\/www.linkedin.com\/in\/btechgeeks\",\"https:\/\/in.pinterest.com\/btechgeek\/\",\"https:\/\/www.youtube.com\/channel\/UC9MlCqdJ3lKqz2p5114SDIg\",\"https:\/\/www.facebook.com\/btechgeeks\",\"https:\/\/twitter.com\/btech_geeks\"],\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/python-programs.com\/#\/schema\/logo\/image\/\",\"url\":\"https:\/\/python-programs.com\/wp-content\/uploads\/2020\/11\/BTechGeeks.png\",\"contentUrl\":\"https:\/\/python-programs.com\/wp-content\/uploads\/2020\/11\/BTechGeeks.png\",\"width\":350,\"height\":70,\"caption\":\"BTech Geeks\"},\"image\":{\"@id\":\"https:\/\/python-programs.com\/#\/schema\/logo\/image\/\"}},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/python-programs.com\/#website\",\"url\":\"https:\/\/python-programs.com\/\",\"name\":\"Python Programs\",\"description\":\"Python Programs with Examples, How To Guides on Python\",\"publisher\":{\"@id\":\"https:\/\/python-programs.com\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/python-programs.com\/?s={search_term_string}\"},\"query-input\":\"required name=search_term_string\"}],\"inLanguage\":\"en-US\"},{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/python-programs.com\/python-program-to-print-all-permutations-of-a-string-in-lexicographic-order-without-recursion\/#primaryimage\",\"url\":\"https:\/\/python-programs.com\/wp-content\/uploads\/2021\/06\/Python-Program-to-Print-All-Permutations-of-a-String-in-Lexicographic-Order-without-Recursion.png\",\"contentUrl\":\"https:\/\/python-programs.com\/wp-content\/uploads\/2021\/06\/Python-Program-to-Print-All-Permutations-of-a-String-in-Lexicographic-Order-without-Recursion.png\",\"width\":1280,\"height\":720,\"caption\":\"Python Program to Print All Permutations of a String in Lexicographic Order without Recursion\"},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/python-programs.com\/python-program-to-print-all-permutations-of-a-string-in-lexicographic-order-without-recursion\/#webpage\",\"url\":\"https:\/\/python-programs.com\/python-program-to-print-all-permutations-of-a-string-in-lexicographic-order-without-recursion\/\",\"name\":\"Python Program to Print All Permutations of a String in Lexicographic Order without Recursion - Python Programs\",\"isPartOf\":{\"@id\":\"https:\/\/python-programs.com\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\/\/python-programs.com\/python-program-to-print-all-permutations-of-a-string-in-lexicographic-order-without-recursion\/#primaryimage\"},\"datePublished\":\"2021-09-30T06:30:04+00:00\",\"dateModified\":\"2021-11-22T13:05:27+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/python-programs.com\/python-program-to-print-all-permutations-of-a-string-in-lexicographic-order-without-recursion\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/python-programs.com\/python-program-to-print-all-permutations-of-a-string-in-lexicographic-order-without-recursion\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/python-programs.com\/python-program-to-print-all-permutations-of-a-string-in-lexicographic-order-without-recursion\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/python-programs.com\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Python Program to Print All Permutations of a String in Lexicographic Order without Recursion\"}]},{\"@type\":\"Article\",\"@id\":\"https:\/\/python-programs.com\/python-program-to-print-all-permutations-of-a-string-in-lexicographic-order-without-recursion\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/python-programs.com\/python-program-to-print-all-permutations-of-a-string-in-lexicographic-order-without-recursion\/#webpage\"},\"author\":{\"@id\":\"https:\/\/python-programs.com\/#\/schema\/person\/fb109fd98e2d5a15fd4dac9970797602\"},\"headline\":\"Python Program to Print All Permutations of a String in Lexicographic Order without Recursion\",\"datePublished\":\"2021-09-30T06:30:04+00:00\",\"dateModified\":\"2021-11-22T13:05:27+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/python-programs.com\/python-program-to-print-all-permutations-of-a-string-in-lexicographic-order-without-recursion\/#webpage\"},\"wordCount\":512,\"commentCount\":0,\"publisher\":{\"@id\":\"https:\/\/python-programs.com\/#organization\"},\"image\":{\"@id\":\"https:\/\/python-programs.com\/python-program-to-print-all-permutations-of-a-string-in-lexicographic-order-without-recursion\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/python-programs.com\/wp-content\/uploads\/2021\/06\/Python-Program-to-Print-All-Permutations-of-a-String-in-Lexicographic-Order-without-Recursion.png\",\"articleSection\":[\"Python\"],\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\/\/python-programs.com\/python-program-to-print-all-permutations-of-a-string-in-lexicographic-order-without-recursion\/#respond\"]}]},{\"@type\":\"Person\",\"@id\":\"https:\/\/python-programs.com\/#\/schema\/person\/fb109fd98e2d5a15fd4dac9970797602\",\"name\":\"Vikram Chiluka\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/python-programs.com\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/secure.gravatar.com\/avatar\/c56c77f578d45de43af6feb443618ed7?s=96&d=mm&r=g\",\"contentUrl\":\"https:\/\/secure.gravatar.com\/avatar\/c56c77f578d45de43af6feb443618ed7?s=96&d=mm&r=g\",\"caption\":\"Vikram Chiluka\"},\"url\":\"https:\/\/python-programs.com\/author\/vikram\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Python Program to Print All Permutations of a String in Lexicographic Order without Recursion - Python Programs","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/python-programs.com\/python-program-to-print-all-permutations-of-a-string-in-lexicographic-order-without-recursion\/","og_locale":"en_US","og_type":"article","og_title":"Python Program to Print All Permutations of a String in Lexicographic Order without Recursion - Python Programs","og_description":"Strings in Python: Strings are simple text in programming, which might be individual letters, words, phrases, or whole sentences. Python strings have powerful text-processing capabilities, such as searching and replacing characters, cutting characters, and changing case. Empty strings are written as two quotations separated by a space. Single or double quotation marks may be used. &hellip; Python Program to Print All Permutations of a String in Lexicographic Order without Recursion Read More &raquo;","og_url":"https:\/\/python-programs.com\/python-program-to-print-all-permutations-of-a-string-in-lexicographic-order-without-recursion\/","og_site_name":"Python Programs","article_publisher":"https:\/\/www.facebook.com\/btechgeeks","article_published_time":"2021-09-30T06:30:04+00:00","article_modified_time":"2021-11-22T13:05:27+00:00","og_image":[{"width":1280,"height":720,"url":"https:\/\/python-programs.com\/wp-content\/uploads\/2021\/06\/Python-Program-to-Print-All-Permutations-of-a-String-in-Lexicographic-Order-without-Recursion.png","type":"image\/png"}],"twitter_card":"summary_large_image","twitter_creator":"@btech_geeks","twitter_site":"@btech_geeks","twitter_misc":{"Written by":"Vikram Chiluka","Est. reading time":"5 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Organization","@id":"https:\/\/python-programs.com\/#organization","name":"BTech Geeks","url":"https:\/\/python-programs.com\/","sameAs":["https:\/\/www.instagram.com\/btechgeeks\/","https:\/\/www.linkedin.com\/in\/btechgeeks","https:\/\/in.pinterest.com\/btechgeek\/","https:\/\/www.youtube.com\/channel\/UC9MlCqdJ3lKqz2p5114SDIg","https:\/\/www.facebook.com\/btechgeeks","https:\/\/twitter.com\/btech_geeks"],"logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/python-programs.com\/#\/schema\/logo\/image\/","url":"https:\/\/python-programs.com\/wp-content\/uploads\/2020\/11\/BTechGeeks.png","contentUrl":"https:\/\/python-programs.com\/wp-content\/uploads\/2020\/11\/BTechGeeks.png","width":350,"height":70,"caption":"BTech Geeks"},"image":{"@id":"https:\/\/python-programs.com\/#\/schema\/logo\/image\/"}},{"@type":"WebSite","@id":"https:\/\/python-programs.com\/#website","url":"https:\/\/python-programs.com\/","name":"Python Programs","description":"Python Programs with Examples, How To Guides on Python","publisher":{"@id":"https:\/\/python-programs.com\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/python-programs.com\/?s={search_term_string}"},"query-input":"required name=search_term_string"}],"inLanguage":"en-US"},{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/python-programs.com\/python-program-to-print-all-permutations-of-a-string-in-lexicographic-order-without-recursion\/#primaryimage","url":"https:\/\/python-programs.com\/wp-content\/uploads\/2021\/06\/Python-Program-to-Print-All-Permutations-of-a-String-in-Lexicographic-Order-without-Recursion.png","contentUrl":"https:\/\/python-programs.com\/wp-content\/uploads\/2021\/06\/Python-Program-to-Print-All-Permutations-of-a-String-in-Lexicographic-Order-without-Recursion.png","width":1280,"height":720,"caption":"Python Program to Print All Permutations of a String in Lexicographic Order without Recursion"},{"@type":"WebPage","@id":"https:\/\/python-programs.com\/python-program-to-print-all-permutations-of-a-string-in-lexicographic-order-without-recursion\/#webpage","url":"https:\/\/python-programs.com\/python-program-to-print-all-permutations-of-a-string-in-lexicographic-order-without-recursion\/","name":"Python Program to Print All Permutations of a String in Lexicographic Order without Recursion - Python Programs","isPartOf":{"@id":"https:\/\/python-programs.com\/#website"},"primaryImageOfPage":{"@id":"https:\/\/python-programs.com\/python-program-to-print-all-permutations-of-a-string-in-lexicographic-order-without-recursion\/#primaryimage"},"datePublished":"2021-09-30T06:30:04+00:00","dateModified":"2021-11-22T13:05:27+00:00","breadcrumb":{"@id":"https:\/\/python-programs.com\/python-program-to-print-all-permutations-of-a-string-in-lexicographic-order-without-recursion\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/python-programs.com\/python-program-to-print-all-permutations-of-a-string-in-lexicographic-order-without-recursion\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/python-programs.com\/python-program-to-print-all-permutations-of-a-string-in-lexicographic-order-without-recursion\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/python-programs.com\/"},{"@type":"ListItem","position":2,"name":"Python Program to Print All Permutations of a String in Lexicographic Order without Recursion"}]},{"@type":"Article","@id":"https:\/\/python-programs.com\/python-program-to-print-all-permutations-of-a-string-in-lexicographic-order-without-recursion\/#article","isPartOf":{"@id":"https:\/\/python-programs.com\/python-program-to-print-all-permutations-of-a-string-in-lexicographic-order-without-recursion\/#webpage"},"author":{"@id":"https:\/\/python-programs.com\/#\/schema\/person\/fb109fd98e2d5a15fd4dac9970797602"},"headline":"Python Program to Print All Permutations of a String in Lexicographic Order without Recursion","datePublished":"2021-09-30T06:30:04+00:00","dateModified":"2021-11-22T13:05:27+00:00","mainEntityOfPage":{"@id":"https:\/\/python-programs.com\/python-program-to-print-all-permutations-of-a-string-in-lexicographic-order-without-recursion\/#webpage"},"wordCount":512,"commentCount":0,"publisher":{"@id":"https:\/\/python-programs.com\/#organization"},"image":{"@id":"https:\/\/python-programs.com\/python-program-to-print-all-permutations-of-a-string-in-lexicographic-order-without-recursion\/#primaryimage"},"thumbnailUrl":"https:\/\/python-programs.com\/wp-content\/uploads\/2021\/06\/Python-Program-to-Print-All-Permutations-of-a-String-in-Lexicographic-Order-without-Recursion.png","articleSection":["Python"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/python-programs.com\/python-program-to-print-all-permutations-of-a-string-in-lexicographic-order-without-recursion\/#respond"]}]},{"@type":"Person","@id":"https:\/\/python-programs.com\/#\/schema\/person\/fb109fd98e2d5a15fd4dac9970797602","name":"Vikram Chiluka","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/python-programs.com\/#\/schema\/person\/image\/","url":"https:\/\/secure.gravatar.com\/avatar\/c56c77f578d45de43af6feb443618ed7?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/c56c77f578d45de43af6feb443618ed7?s=96&d=mm&r=g","caption":"Vikram Chiluka"},"url":"https:\/\/python-programs.com\/author\/vikram\/"}]}},"jetpack_featured_media_url":"https:\/\/python-programs.com\/wp-content\/uploads\/2021\/06\/Python-Program-to-Print-All-Permutations-of-a-String-in-Lexicographic-Order-without-Recursion.png","_links":{"self":[{"href":"https:\/\/python-programs.com\/wp-json\/wp\/v2\/posts\/9549"}],"collection":[{"href":"https:\/\/python-programs.com\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/python-programs.com\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/python-programs.com\/wp-json\/wp\/v2\/users\/7"}],"replies":[{"embeddable":true,"href":"https:\/\/python-programs.com\/wp-json\/wp\/v2\/comments?post=9549"}],"version-history":[{"count":8,"href":"https:\/\/python-programs.com\/wp-json\/wp\/v2\/posts\/9549\/revisions"}],"predecessor-version":[{"id":23300,"href":"https:\/\/python-programs.com\/wp-json\/wp\/v2\/posts\/9549\/revisions\/23300"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/python-programs.com\/wp-json\/wp\/v2\/media\/9554"}],"wp:attachment":[{"href":"https:\/\/python-programs.com\/wp-json\/wp\/v2\/media?parent=9549"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/python-programs.com\/wp-json\/wp\/v2\/categories?post=9549"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/python-programs.com\/wp-json\/wp\/v2\/tags?post=9549"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}