{"id":25872,"date":"2021-12-16T09:20:24","date_gmt":"2021-12-16T03:50:24","guid":{"rendered":"https:\/\/python-programs.com\/?p=25872"},"modified":"2021-12-16T09:20:24","modified_gmt":"2021-12-16T03:50:24","slug":"python-program-for-stooge-sort","status":"publish","type":"post","link":"https:\/\/python-programs.com\/python-program-for-stooge-sort\/","title":{"rendered":"Python Program for Stooge Sort"},"content":{"rendered":"<p><strong>Stooge Sort:<\/strong><\/p>\n<p>Stooge sort is a recursive sorting method with high time complexity. The algorithm&#8217;s execution time is longer than that of the Bubble sort. It is, though, more efficient than slow sorting.<\/p>\n<p><strong>Algorithm:<\/strong><\/p>\n<ul>\n<li>If the value in the first place is greater than the value in the last position, swap them.<\/li>\n<li>If the list contains three or more elements, then<\/li>\n<\/ul>\n<ol>\n<li>To begin, Stooge sorts the first two-thirds of the list.<\/li>\n<li>Second, Stooge sorts the final two-thirds of the list.<\/li>\n<li>Finally, Stooge sorts the first two-thirds of the list once more.<\/li>\n<\/ol>\n<p><strong>Steps:<\/strong><\/p>\n<p>The array is first given to the function, which compares the first and last elements and swaps them if the first element is smaller.<\/p>\n<p>Next, we assess the array&#8217;s size; if the size is greater than two, the array&#8217;s sections are called recursively to sort the first, last, and first two-thirds(2\/3) of the array.<\/p>\n<p>Finally, simply show the sorted array on the window.<\/p>\n<p><strong>Examples:<\/strong><\/p>\n<p><strong>Example1:<\/strong><\/p>\n<p><strong>Input:<\/strong><\/p>\n<pre>Given List = [80, 90, 20, -10, 36]<\/pre>\n<p><strong>Output:<\/strong><\/p>\n<pre id=\"codeOutputPre\">The given list after sorting =  [-10, 20, 36, 80, 90]<\/pre>\n<p><strong>Example2:<\/strong><\/p>\n<p><strong>Input:<\/strong><\/p>\n<pre>Given List = [56, 43, -3, 100, 13]<\/pre>\n<p><strong>Output:<\/strong><\/p>\n<pre>The given list after sorting = [-3, 13, 43, 56, 100]<\/pre>\n<h2>Program for Stooge Sort in Python<\/h2>\n<p>&nbsp;<\/p>\n<h3 id=\"Using_Built-in_Functions_(Static_Input)\">Method #1: Using Recursion (Static Input)<\/h3>\n<p><strong>Approach:<\/strong><\/p>\n<ul>\n<li>Give the list as static input and store it in a variable.<\/li>\n<li>Calculate the length of the given list using the len() function and store it in another variable.<\/li>\n<li>Take a variable and initialize it with the start value as 0.<\/li>\n<li>Take another variable and initialize it with the end value as the length of the list-1.<\/li>\n<li>Create a Recursive function say Stooge_Sorting() which accepts the given list, start value and end value as the arguments and returns the sorted list.<\/li>\n<li>Inside the function, check whether the list has any elements using the if conditional statement.<\/li>\n<li>If it is true then return.<\/li>\n<li>Check whether the element present at the start value of the list is greater than the element present at the end value using the if conditional statement.<\/li>\n<li>If it is true, then swap both of them.<\/li>\n<li>Check whether there are more than two elements using the if conditional statement.<\/li>\n<li>If it is true, then pass the (gvn_lst, strt_val, (end_val-tempry)) as the arguments to the function itself (Recursive Logic).<\/li>\n<li>Pass the (gvn_lst, strt_val+tempry, (end_val)) as the arguments to the function itself (Recursive Logic).<\/li>\n<li>Pass the (gvn_lst, strt_val, (end_val-tempry)) as the arguments to the function itself (Recursive Logic).<\/li>\n<li>Pass the given list, start value, and end value as the arguments to the Stooge_Sorting() function.<\/li>\n<li>Print the given list after sorting.<\/li>\n<li>The Exit of the Program.<\/li>\n<\/ul>\n<p><strong>Below is the implementation:<\/strong><\/p>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\"># Create a Recursive function say Stooge_Sorting() which accepts the given list,\r\n# start value and end value as the arguments and returns the sorted list.\r\n\r\n\r\ndef Stooge_Sorting(gvn_lst, strt_val, end_val):\r\n    # Inside the function, check whether the list has any elements using the if\r\n        # conditional statement.\r\n    if strt_val &gt;= end_val:\r\n        # If it is true then return.\r\n        return\r\n    # Check whether the element present at the start value of the list is greater\r\n        # than the element present at the end value using the if conditional statement.\r\n    if gvn_lst[strt_val] &gt; gvn_lst[end_val]:\r\n        # If it is true, then swap both of them.\r\n        gvn_lst[strt_val], gvn_lst[end_val] = gvn_lst[end_val], gvn_lst[strt_val]\r\n        # Check whether there are more than two elements using the if conditional\r\n    # statement.\r\n    if end_val-strt_val+1 &gt; 2:\r\n        tempry = (int)((end_val-strt_val+1)\/3)\r\n        # If it is true, then pass the (gvn_lst, strt_val, (end_val-tempry)) as the\r\n        # arguments to the function itself (Recursive Logic).\r\n        Stooge_Sorting(gvn_lst, strt_val, (end_val-tempry))\r\n        # Pass the (gvn_lst, strt_val+tempry, (end_val)) as the arguments to the\r\n        # function itself (Recursive Logic).\r\n        Stooge_Sorting(gvn_lst, strt_val+tempry, (end_val))\r\n        # Pass the (gvn_lst, strt_val, (end_val-tempry)) as the\r\n        # arguments to the function itself (Recursive Logic).\r\n        Stooge_Sorting(gvn_lst, strt_val, (end_val-tempry))\r\n\r\n\r\n# Give the list as static input and store it in a variable.\r\ngvn_lst = [80, 90, 20, -10, 36]\r\n# Calculate the length of the given list using the len() function and store\r\n# it in another variable.\r\nlst_len = len(gvn_lst)\r\n# Take a variable and initialize it with the start value as 0.\r\nstrt_val = 0\r\n# Take another variable and initialize it with the end value as length of the\r\n# list-1.\r\nend_val = lst_len-1\r\n# Pass the given list, start value, and end value as the arguments to the\r\n# Stooge_Sorting() function.\r\nStooge_Sorting(gvn_lst, strt_val, end_val)\r\n# Print the given list after sorting.\r\nprint(\"The given list after sorting = \", gvn_lst)\r\n<\/pre>\n<p><strong>Output:<\/strong><\/p>\n<pre id=\"codeOutputPre\">The given list after sorting =  [-10, 20, 36, 80, 90]<\/pre>\n<h3 id=\"Using_Built-in_Functions_(User_Input)\">Method #2: Using Recursion (User Input)<\/h3>\n<p><strong>Approach:<\/strong><\/p>\n<ul>\n<li>Give the list as user input using list(),map(),input(),and split() functions.<\/li>\n<li>Store it in a variable.<\/li>\n<li>Calculate the length of the given list using the len() function and store it in another variable.<\/li>\n<li>Take a variable and initialize it with the start value as 0.<\/li>\n<li>Take another variable and initialize it with the end value as the length of the list-1.<\/li>\n<li>Create a Recursive function say Stooge_Sorting() which accepts the given list, start value and end value as the arguments and returns the sorted list.<\/li>\n<li>Inside the function, check whether the list has any elements using the if conditional statement.<\/li>\n<li>If it is true then return.<\/li>\n<li>Check whether the element present at the start value of the list is greater than the element present at the end value using the if conditional statement.<\/li>\n<li>If it is true, then swap both of them.<\/li>\n<li>Check whether there are more than two elements using the if conditional statement.<\/li>\n<li>If it is true, then pass the (gvn_lst, strt_val, (end_val-tempry)) as the arguments to the function itself (Recursive Logic).<\/li>\n<li>Pass the (gvn_lst, strt_val+tempry, (end_val)) as the arguments to the function itself (Recursive Logic).<\/li>\n<li>Pass the (gvn_lst, strt_val, (end_val-tempry)) as the arguments to the function itself (Recursive Logic).<\/li>\n<li>Pass the given list, start value, and end value as the arguments to the Stooge_Sorting() function.<\/li>\n<li>Print the given list after sorting.<\/li>\n<li>The Exit of the Program.<\/li>\n<\/ul>\n<p><strong>Below is the implementation:<\/strong><\/p>\n<pre class=\"EnlighterJSRAW\" data-enlighter-language=\"python\"># Create a Recursive function say Stooge_Sorting() which accepts the given list,\r\n# start value and end value as the arguments and returns the sorted list.\r\n\r\n\r\ndef Stooge_Sorting(gvn_lst, strt_val, end_val):\r\n    # Inside the function, check whether the list has any elements using the if\r\n        # conditional statement.\r\n    if strt_val &gt;= end_val:\r\n        # If it is true then return.\r\n        return\r\n    # Check whether the element present at the start value of the list is greater\r\n        # than the element present at the end value using the if conditional statement.\r\n    if gvn_lst[strt_val] &gt; gvn_lst[end_val]:\r\n        # If it is true, then swap both of them.\r\n        gvn_lst[strt_val], gvn_lst[end_val] = gvn_lst[end_val], gvn_lst[strt_val]\r\n        # Check whether there are more than two elements using the if conditional\r\n    # statement.\r\n    if end_val-strt_val+1 &gt; 2:\r\n        tempry = (int)((end_val-strt_val+1)\/3)\r\n        # If it is true, then pass the (gvn_lst, strt_val, (end_val-tempry)) as the\r\n        # arguments to the function itself (Recursive Logic).\r\n        Stooge_Sorting(gvn_lst, strt_val, (end_val-tempry))\r\n        # Pass the (gvn_lst, strt_val+tempry, (end_val)) as the arguments to the\r\n        # function itself (Recursive Logic).\r\n        Stooge_Sorting(gvn_lst, strt_val+tempry, (end_val))\r\n        # Pass the (gvn_lst, strt_val, (end_val-tempry)) as the\r\n        # arguments to the function itself (Recursive Logic).\r\n        Stooge_Sorting(gvn_lst, strt_val, (end_val-tempry))\r\n\r\n\r\n# Give the list as user input using list(),map(),input(),and split() functions.\r\n# Store it in a variable.\r\ngvn_lst = list(map(int, input(\r\n   'Enter some random List Elements separated by spaces = ').split()))\r\n   \r\n# Calculate the length of the given list using the len() function and store\r\n# it in another variable.\r\nlst_len = len(gvn_lst)\r\n# Take a variable and initialize it with the start value as 0.\r\nstrt_val = 0\r\n# Take another variable and initialize it with the end value as length of the\r\n# list-1.\r\nend_val = lst_len-1\r\n# Pass the given list, start value, and end value as the arguments to the\r\n# Stooge_Sorting() function.\r\nStooge_Sorting(gvn_lst, strt_val, end_val)\r\n# Print the given list after sorting.\r\nprint(\"The given list after sorting = \", gvn_lst)\r\n<\/pre>\n<p><strong>Output:<\/strong><\/p>\n<pre>Enter some random List Elements separated by spaces = 56 43 -3 100 13\r\nThe given list after sorting = [-3, 13, 43, 56, 100]<\/pre>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Stooge Sort: Stooge sort is a recursive sorting method with high time complexity. The algorithm&#8217;s execution time is longer than that of the Bubble sort. It is, though, more efficient than slow sorting. Algorithm: If the value in the first place is greater than the value in the last position, swap them. If the list &hellip;<\/p>\n<p class=\"read-more\"> <a class=\"\" href=\"https:\/\/python-programs.com\/python-program-for-stooge-sort\/\"> <span class=\"screen-reader-text\">Python Program for Stooge Sort<\/span> Read More &raquo;<\/a><\/p>\n","protected":false},"author":7,"featured_media":0,"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 for Stooge Sort - 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-for-stooge-sort\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Python Program for Stooge Sort - Python Programs\" \/>\n<meta property=\"og:description\" content=\"Stooge Sort: Stooge sort is a recursive sorting method with high time complexity. The algorithm&#8217;s execution time is longer than that of the Bubble sort. It is, though, more efficient than slow sorting. Algorithm: If the value in the first place is greater than the value in the last position, swap them. If the list &hellip; Python Program for Stooge Sort Read More &raquo;\" \/>\n<meta property=\"og:url\" content=\"https:\/\/python-programs.com\/python-program-for-stooge-sort\/\" \/>\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-12-16T03:50:24+00:00\" \/>\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=\"6 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\":\"WebPage\",\"@id\":\"https:\/\/python-programs.com\/python-program-for-stooge-sort\/#webpage\",\"url\":\"https:\/\/python-programs.com\/python-program-for-stooge-sort\/\",\"name\":\"Python Program for Stooge Sort - Python Programs\",\"isPartOf\":{\"@id\":\"https:\/\/python-programs.com\/#website\"},\"datePublished\":\"2021-12-16T03:50:24+00:00\",\"dateModified\":\"2021-12-16T03:50:24+00:00\",\"breadcrumb\":{\"@id\":\"https:\/\/python-programs.com\/python-program-for-stooge-sort\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/python-programs.com\/python-program-for-stooge-sort\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/python-programs.com\/python-program-for-stooge-sort\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/python-programs.com\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Python Program for Stooge Sort\"}]},{\"@type\":\"Article\",\"@id\":\"https:\/\/python-programs.com\/python-program-for-stooge-sort\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/python-programs.com\/python-program-for-stooge-sort\/#webpage\"},\"author\":{\"@id\":\"https:\/\/python-programs.com\/#\/schema\/person\/fb109fd98e2d5a15fd4dac9970797602\"},\"headline\":\"Python Program for Stooge Sort\",\"datePublished\":\"2021-12-16T03:50:24+00:00\",\"dateModified\":\"2021-12-16T03:50:24+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/python-programs.com\/python-program-for-stooge-sort\/#webpage\"},\"wordCount\":675,\"commentCount\":0,\"publisher\":{\"@id\":\"https:\/\/python-programs.com\/#organization\"},\"articleSection\":[\"Python\"],\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\/\/python-programs.com\/python-program-for-stooge-sort\/#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 for Stooge Sort - 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-for-stooge-sort\/","og_locale":"en_US","og_type":"article","og_title":"Python Program for Stooge Sort - Python Programs","og_description":"Stooge Sort: Stooge sort is a recursive sorting method with high time complexity. The algorithm&#8217;s execution time is longer than that of the Bubble sort. It is, though, more efficient than slow sorting. Algorithm: If the value in the first place is greater than the value in the last position, swap them. If the list &hellip; Python Program for Stooge Sort Read More &raquo;","og_url":"https:\/\/python-programs.com\/python-program-for-stooge-sort\/","og_site_name":"Python Programs","article_publisher":"https:\/\/www.facebook.com\/btechgeeks","article_published_time":"2021-12-16T03:50:24+00:00","twitter_card":"summary_large_image","twitter_creator":"@btech_geeks","twitter_site":"@btech_geeks","twitter_misc":{"Written by":"Vikram Chiluka","Est. reading time":"6 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":"WebPage","@id":"https:\/\/python-programs.com\/python-program-for-stooge-sort\/#webpage","url":"https:\/\/python-programs.com\/python-program-for-stooge-sort\/","name":"Python Program for Stooge Sort - Python Programs","isPartOf":{"@id":"https:\/\/python-programs.com\/#website"},"datePublished":"2021-12-16T03:50:24+00:00","dateModified":"2021-12-16T03:50:24+00:00","breadcrumb":{"@id":"https:\/\/python-programs.com\/python-program-for-stooge-sort\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/python-programs.com\/python-program-for-stooge-sort\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/python-programs.com\/python-program-for-stooge-sort\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/python-programs.com\/"},{"@type":"ListItem","position":2,"name":"Python Program for Stooge Sort"}]},{"@type":"Article","@id":"https:\/\/python-programs.com\/python-program-for-stooge-sort\/#article","isPartOf":{"@id":"https:\/\/python-programs.com\/python-program-for-stooge-sort\/#webpage"},"author":{"@id":"https:\/\/python-programs.com\/#\/schema\/person\/fb109fd98e2d5a15fd4dac9970797602"},"headline":"Python Program for Stooge Sort","datePublished":"2021-12-16T03:50:24+00:00","dateModified":"2021-12-16T03:50:24+00:00","mainEntityOfPage":{"@id":"https:\/\/python-programs.com\/python-program-for-stooge-sort\/#webpage"},"wordCount":675,"commentCount":0,"publisher":{"@id":"https:\/\/python-programs.com\/#organization"},"articleSection":["Python"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/python-programs.com\/python-program-for-stooge-sort\/#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":"","_links":{"self":[{"href":"https:\/\/python-programs.com\/wp-json\/wp\/v2\/posts\/25872"}],"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=25872"}],"version-history":[{"count":3,"href":"https:\/\/python-programs.com\/wp-json\/wp\/v2\/posts\/25872\/revisions"}],"predecessor-version":[{"id":25875,"href":"https:\/\/python-programs.com\/wp-json\/wp\/v2\/posts\/25872\/revisions\/25875"}],"wp:attachment":[{"href":"https:\/\/python-programs.com\/wp-json\/wp\/v2\/media?parent=25872"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/python-programs.com\/wp-json\/wp\/v2\/categories?post=25872"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/python-programs.com\/wp-json\/wp\/v2\/tags?post=25872"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}