{"id":333,"date":"2023-03-30T11:29:16","date_gmt":"2023-03-30T11:29:16","guid":{"rendered":"https:\/\/vmlogger.com\/algorithms\/?p=333"},"modified":"2023-05-03T10:32:30","modified_gmt":"2023-05-03T10:32:30","slug":"merge-sort-in-python-the-ultimate-guide","status":"publish","type":"post","link":"https:\/\/vmlogger.com\/algorithms\/2023\/03\/30\/merge-sort-in-python-the-ultimate-guide\/","title":{"rendered":"Merge Sort in Python: The Ultimate Guide"},"content":{"rendered":"

If you’re a programmer or data scientist, you’ve probably heard of the merge sort algorithm. Merge sort is a popular and efficient sorting algorithm widely used in computer science. In this guide, we’ll explore what merge sort is, how it works, and how to implement it in Python.<\/p>\n

\n

Topics Covered<\/h3>\n
    \n
  1. What is Merge Sort?<\/li>\n
  2. What is Merge Sort Used For?<\/li>\n
  3. Implementation of Merge Sort in Python<\/li>\n
  4. Visual representation of Merge Sort<\/li>\n
  5. Is Merge Sort Faster Than Quicksort?<\/li>\n
  6. Why is Merge Sort More Effective?<\/li>\n<\/ol>\n<\/div>\n

    What is Merge Sort?<\/h2>\n

    Merge sort is based on a divide-and-conquer principle. This works by breaking down the array into smaller subarrays, sorting those subarrays, and then merging them back together. Once you will follow the below example with python code, it will be more precise.<\/p>\n

    \"Merge

    Merge Sort Visualization – Source – Wikipedia<\/p><\/div>\n

    What is Merge Sort Used For?<\/h2>\n

    Merge sort is commonly used for sorting large datasets, as it is efficient and fast, even for very large arrays. It’s also useful for parallel sorting, where multiple processors can be used to sort the data.<\/p>\n

    Implementation of Merge Sort in Python<\/h2>\n

    Following the python code to implement merge sort in Python. The time complexity of merge sort is O(n*log n)<\/code> where n<\/code> is the number of elements in the array.<\/p>\n

    \r\ndef mergeSort(array, asc=True):\r\n    '''\r\n    Time complexity : O(nlog(n)))\r\n    parameters:\r\n        array   : Array of numbers to be sorted\r\n        asc     : boolean flag to sort ascending\r\n                  descending. Default = True (ascending)\r\n    '''\r\n    midIdx = len(array) \/\/ 2\r\n   \r\n    if len(array) == 1:\r\n        return array\r\n    \r\n    leftArr = array[:midIdx]\r\n    rightArr = array[midIdx:]\r\n    # Double recursion\r\n    # 1. To keep on dividing the entire\r\n    #    in half until only one item is left\r\n    #    in both left and right side arrays\r\n    # 2. Each time those sub-arrays will be passed\r\n    #    in the other recursive function, whihc will \r\n    #    return the sorted sub array.\r\n    return sortArray(mergeSort(leftArr, asc), mergeSort(rightArr, asc), asc)\r\n    \r\ndef sortArray(leftArray, rightArray, asc):\r\n    sortedArray = [None] * (len(leftArray) + len(rightArray))\r\n    i=j=k=0\r\n    while i < len(leftArray) and j < len(rightArray):\r\n        # based on ascending or descending order\r\n        if asc:\r\n            if leftArray[i] <= rightArray[j]:\r\n                sortedArray[k] = leftArray[i]\r\n                i += 1\r\n            else :\r\n                sortedArray[k] = rightArray[j]\r\n                j += 1\r\n        else:\r\n            if leftArray[i] >= rightArray[j]:\r\n                sortedArray[k] = leftArray[i]\r\n                i += 1\r\n            else :\r\n                sortedArray[k] = rightArray[j]\r\n                j += 1\r\n        k += 1\r\n    \r\n    while i < len(leftArray):\r\n        sortedArray[k] = leftArray[i]\r\n        i += 1\r\n        k += 1\r\n    while j < len(rightArray):\r\n        sortedArray[k] = rightArray[j]\r\n        j += 1\r\n        k += 1\r\n    \r\n    return sortedArray\r\n\r\nif __name__ == \"__main__\":\r\n    arrayToSort = [4, 6, 1, 10, 8, 9, 50, 7, 56]\r\n    print(\"Array in ascending order :\", mergeSort(arrayToSort))\r\n    print(\"Array in descending order :\", mergeSort(arrayToSort, asc=False))\r\n\r\n<\/pre>\n
    Visual representation of Merge Sort<\/h2>\n
    This example shows how merge sort can be used to sort an array of integers in Python. The algorithm divides the array in half, sorts each half recursively, and then merges the sorted halves back together. Refer to the below-animated visualization gif [from Wikipedia] which explains the process of divide and conquer sorting algorithm which is also called merge sort.<\/p>\n
    \"Merge
    Merge Sort Visualization - Source - Wikipedia<\/p><\/div>\n
    Is Merge Sort Faster Than Quicksort?<\/h2>\n
    The time complexity of merge sort is O(n*log n)<\/code>, where n<\/code> is the number of elements in the array. This means that the time required to sort the array increases logarithmically with the number of elements. Both merge sort and quicksort are efficient sorting algorithms, but they have different strengths and weaknesses. Merge sort is generally considered to be more efficient for sorting large datasets, while quicksort is better for small to medium-sized datasets.<\/p>\n
    Why is Merge Sort More Effective?<\/h2>\n
    Merge sort has several advantages over other sorting algorithms, such as:<\/p>\n
      \n
    1. It is highly scalable and can handle large datasets.<\/li>\n
    2. It is a stable sorting algorithm that maintains the relative order of equal elements.<\/li>\n
    3. It is easy to implement and understand.<\/li>\n<\/ol>\n
      \n
      Conclusion:<\/h3>\n
      Merge sort is a powerful and efficient sorting algorithm widely used in computer science. Now you know everything about the merge sort algorithm such as how merge sort works<\/code> and how to implement it in Python<\/code>\n<\/div>\n<\/span>","protected":false},"excerpt":{"rendered":"
      If you’re a programmer or data scientist, you’ve probably heard of the merge sort algorithm. Merge sort is a popular and efficient sorting algorithm widely used in computer science. In this guide, we’ll explore what merge sort is, how it works, and how to implement it in Python. Topics Covered What is Merge Sort? What […]<\/p>\n","protected":false},"author":45,"featured_media":341,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_et_pb_use_builder":"","_et_pb_old_content":"","_et_gb_content_width":"","footnotes":""},"categories":[9,10],"tags":[],"class_list":["post-333","post","type-post","status-publish","format-standard","has-post-thumbnail","hentry","category-medium","category-sorting"],"yoast_head":"\nMerge Sort in Python: The Ultimate Guide - Algorithms<\/title>\n<meta name=\"description\" content=\"Learn how to implement the efficient and powerful merge sort algorithm in Python. From step-by-step explanations to code examples, this comprehensive guide has everything you need to know\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/vmlogger.com\/algorithms\/2023\/03\/30\/merge-sort-in-python-the-ultimate-guide\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Merge Sort in Python: The Ultimate Guide\" \/>\n<meta property=\"og:description\" content=\"Learn how to implement the efficient and powerful merge sort algorithm in Python. From step-by-step explanations to code examples, this comprehensive guide has everything you need to know\" \/>\n<meta property=\"og:url\" content=\"https:\/\/vmlogger.com\/algorithms\/2023\/03\/30\/merge-sort-in-python-the-ultimate-guide\/\" \/>\n<meta property=\"og:site_name\" content=\"Algorithms\" \/>\n<meta property=\"article:publisher\" content=\"http:\/\/www.facebook.com\/vmlogger\" \/>\n<meta property=\"article:author\" content=\"http:\/\/www.facebook.com\/vmlogger\" \/>\n<meta property=\"article:published_time\" content=\"2023-03-30T11:29:16+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2023-05-03T10:32:30+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/vmlogger.com\/algorithms\/wp-content\/uploads\/sites\/15\/2023\/03\/merge-sorting.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=\"author\" content=\"Vishwamitra Mishra\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:creator\" content=\"@https:\/\/www.twitter.com\/learnexcelmacro\" \/>\n<meta name=\"twitter:site\" content=\"@learnexcelmacro\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Vishwamitra Mishra\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"3 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\/\/vmlogger.com\/algorithms\/2023\/03\/30\/merge-sort-in-python-the-ultimate-guide\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/vmlogger.com\/algorithms\/2023\/03\/30\/merge-sort-in-python-the-ultimate-guide\/\"},\"author\":{\"name\":\"Vishwamitra Mishra\",\"@id\":\"https:\/\/vmlogger.com\/algorithms\/#\/schema\/person\/7500a107b0b2d35a8492acf0d11fc8e5\"},\"headline\":\"Merge Sort in Python: The Ultimate Guide\",\"datePublished\":\"2023-03-30T11:29:16+00:00\",\"dateModified\":\"2023-05-03T10:32:30+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\/\/vmlogger.com\/algorithms\/2023\/03\/30\/merge-sort-in-python-the-ultimate-guide\/\"},\"wordCount\":458,\"commentCount\":0,\"publisher\":{\"@id\":\"https:\/\/vmlogger.com\/algorithms\/#\/schema\/person\/7500a107b0b2d35a8492acf0d11fc8e5\"},\"image\":{\"@id\":\"https:\/\/vmlogger.com\/algorithms\/2023\/03\/30\/merge-sort-in-python-the-ultimate-guide\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/vmlogger.com\/algorithms\/wp-content\/uploads\/sites\/15\/2023\/03\/merge-sorting.png\",\"articleSection\":[\"Medium\",\"Sorting\"],\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\/\/vmlogger.com\/algorithms\/2023\/03\/30\/merge-sort-in-python-the-ultimate-guide\/#respond\"]}]},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/vmlogger.com\/algorithms\/2023\/03\/30\/merge-sort-in-python-the-ultimate-guide\/\",\"url\":\"https:\/\/vmlogger.com\/algorithms\/2023\/03\/30\/merge-sort-in-python-the-ultimate-guide\/\",\"name\":\"Merge Sort in Python: The Ultimate Guide - Algorithms\",\"isPartOf\":{\"@id\":\"https:\/\/vmlogger.com\/algorithms\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\/\/vmlogger.com\/algorithms\/2023\/03\/30\/merge-sort-in-python-the-ultimate-guide\/#primaryimage\"},\"image\":{\"@id\":\"https:\/\/vmlogger.com\/algorithms\/2023\/03\/30\/merge-sort-in-python-the-ultimate-guide\/#primaryimage\"},\"thumbnailUrl\":\"https:\/\/vmlogger.com\/algorithms\/wp-content\/uploads\/sites\/15\/2023\/03\/merge-sorting.png\",\"datePublished\":\"2023-03-30T11:29:16+00:00\",\"dateModified\":\"2023-05-03T10:32:30+00:00\",\"description\":\"Learn how to implement the efficient and powerful merge sort algorithm in Python. From step-by-step explanations to code examples, this comprehensive guide has everything you need to know\",\"breadcrumb\":{\"@id\":\"https:\/\/vmlogger.com\/algorithms\/2023\/03\/30\/merge-sort-in-python-the-ultimate-guide\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/vmlogger.com\/algorithms\/2023\/03\/30\/merge-sort-in-python-the-ultimate-guide\/\"]}]},{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/vmlogger.com\/algorithms\/2023\/03\/30\/merge-sort-in-python-the-ultimate-guide\/#primaryimage\",\"url\":\"https:\/\/vmlogger.com\/algorithms\/wp-content\/uploads\/sites\/15\/2023\/03\/merge-sorting.png\",\"contentUrl\":\"https:\/\/vmlogger.com\/algorithms\/wp-content\/uploads\/sites\/15\/2023\/03\/merge-sorting.png\",\"width\":1280,\"height\":720,\"caption\":\"Merge Sort Algorithm\"},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/vmlogger.com\/algorithms\/2023\/03\/30\/merge-sort-in-python-the-ultimate-guide\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/vmlogger.com\/algorithms\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Merge Sort in Python: The Ultimate Guide\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/vmlogger.com\/algorithms\/#website\",\"url\":\"https:\/\/vmlogger.com\/algorithms\/\",\"name\":\"Algorithms\",\"description\":\"Welcome to the World of Algorithms\",\"publisher\":{\"@id\":\"https:\/\/vmlogger.com\/algorithms\/#\/schema\/person\/7500a107b0b2d35a8492acf0d11fc8e5\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/vmlogger.com\/algorithms\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"},{\"@type\":[\"Person\",\"Organization\"],\"@id\":\"https:\/\/vmlogger.com\/algorithms\/#\/schema\/person\/7500a107b0b2d35a8492acf0d11fc8e5\",\"name\":\"Vishwamitra Mishra\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\/\/vmlogger.com\/algorithms\/#\/schema\/person\/image\/\",\"url\":\"https:\/\/vmlogger.com\/algorithms\/wp-content\/uploads\/sites\/15\/2023\/03\/welcome-1.png\",\"contentUrl\":\"https:\/\/vmlogger.com\/algorithms\/wp-content\/uploads\/sites\/15\/2023\/03\/welcome-1.png\",\"width\":1963,\"height\":843,\"caption\":\"Vishwamitra Mishra\"},\"logo\":{\"@id\":\"https:\/\/vmlogger.com\/algorithms\/#\/schema\/person\/image\/\"},\"description\":\"My name is Vishwamitra Mishra. Friends Call me Vishwa. I hold a Bachelor\u2019s Degree in Computer Science from D.A.V.V. Indore & currently working as a Technical Lead having over 7 years of experience.\",\"sameAs\":[\"http:\/\/www.learnexcelmacro.com\",\"http:\/\/www.facebook.com\/vmlogger\",\"https:\/\/x.com\/https:\/\/www.twitter.com\/learnexcelmacro\",\"https:\/\/www.youtube.com\/c\/VMLogger\"],\"url\":\"https:\/\/vmlogger.com\/algorithms\/author\/vishwamitra\/\"}]}<\/script>\n<!-- \/ Yoast SEO Premium plugin. -->","yoast_head_json":{"title":"Merge Sort in Python: The Ultimate Guide - Algorithms","description":"Learn how to implement the efficient and powerful merge sort algorithm in Python. From step-by-step explanations to code examples, this comprehensive guide has everything you need to know","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:\/\/vmlogger.com\/algorithms\/2023\/03\/30\/merge-sort-in-python-the-ultimate-guide\/","og_locale":"en_US","og_type":"article","og_title":"Merge Sort in Python: The Ultimate Guide","og_description":"Learn how to implement the efficient and powerful merge sort algorithm in Python. From step-by-step explanations to code examples, this comprehensive guide has everything you need to know","og_url":"https:\/\/vmlogger.com\/algorithms\/2023\/03\/30\/merge-sort-in-python-the-ultimate-guide\/","og_site_name":"Algorithms","article_publisher":"http:\/\/www.facebook.com\/vmlogger","article_author":"http:\/\/www.facebook.com\/vmlogger","article_published_time":"2023-03-30T11:29:16+00:00","article_modified_time":"2023-05-03T10:32:30+00:00","og_image":[{"width":1280,"height":720,"url":"https:\/\/vmlogger.com\/algorithms\/wp-content\/uploads\/sites\/15\/2023\/03\/merge-sorting.png","type":"image\/png"}],"author":"Vishwamitra Mishra","twitter_card":"summary_large_image","twitter_creator":"@https:\/\/www.twitter.com\/learnexcelmacro","twitter_site":"@learnexcelmacro","twitter_misc":{"Written by":"Vishwamitra Mishra","Est. reading time":"3 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/vmlogger.com\/algorithms\/2023\/03\/30\/merge-sort-in-python-the-ultimate-guide\/#article","isPartOf":{"@id":"https:\/\/vmlogger.com\/algorithms\/2023\/03\/30\/merge-sort-in-python-the-ultimate-guide\/"},"author":{"name":"Vishwamitra Mishra","@id":"https:\/\/vmlogger.com\/algorithms\/#\/schema\/person\/7500a107b0b2d35a8492acf0d11fc8e5"},"headline":"Merge Sort in Python: The Ultimate Guide","datePublished":"2023-03-30T11:29:16+00:00","dateModified":"2023-05-03T10:32:30+00:00","mainEntityOfPage":{"@id":"https:\/\/vmlogger.com\/algorithms\/2023\/03\/30\/merge-sort-in-python-the-ultimate-guide\/"},"wordCount":458,"commentCount":0,"publisher":{"@id":"https:\/\/vmlogger.com\/algorithms\/#\/schema\/person\/7500a107b0b2d35a8492acf0d11fc8e5"},"image":{"@id":"https:\/\/vmlogger.com\/algorithms\/2023\/03\/30\/merge-sort-in-python-the-ultimate-guide\/#primaryimage"},"thumbnailUrl":"https:\/\/vmlogger.com\/algorithms\/wp-content\/uploads\/sites\/15\/2023\/03\/merge-sorting.png","articleSection":["Medium","Sorting"],"inLanguage":"en-US","potentialAction":[{"@type":"CommentAction","name":"Comment","target":["https:\/\/vmlogger.com\/algorithms\/2023\/03\/30\/merge-sort-in-python-the-ultimate-guide\/#respond"]}]},{"@type":"WebPage","@id":"https:\/\/vmlogger.com\/algorithms\/2023\/03\/30\/merge-sort-in-python-the-ultimate-guide\/","url":"https:\/\/vmlogger.com\/algorithms\/2023\/03\/30\/merge-sort-in-python-the-ultimate-guide\/","name":"Merge Sort in Python: The Ultimate Guide - Algorithms","isPartOf":{"@id":"https:\/\/vmlogger.com\/algorithms\/#website"},"primaryImageOfPage":{"@id":"https:\/\/vmlogger.com\/algorithms\/2023\/03\/30\/merge-sort-in-python-the-ultimate-guide\/#primaryimage"},"image":{"@id":"https:\/\/vmlogger.com\/algorithms\/2023\/03\/30\/merge-sort-in-python-the-ultimate-guide\/#primaryimage"},"thumbnailUrl":"https:\/\/vmlogger.com\/algorithms\/wp-content\/uploads\/sites\/15\/2023\/03\/merge-sorting.png","datePublished":"2023-03-30T11:29:16+00:00","dateModified":"2023-05-03T10:32:30+00:00","description":"Learn how to implement the efficient and powerful merge sort algorithm in Python. From step-by-step explanations to code examples, this comprehensive guide has everything you need to know","breadcrumb":{"@id":"https:\/\/vmlogger.com\/algorithms\/2023\/03\/30\/merge-sort-in-python-the-ultimate-guide\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/vmlogger.com\/algorithms\/2023\/03\/30\/merge-sort-in-python-the-ultimate-guide\/"]}]},{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/vmlogger.com\/algorithms\/2023\/03\/30\/merge-sort-in-python-the-ultimate-guide\/#primaryimage","url":"https:\/\/vmlogger.com\/algorithms\/wp-content\/uploads\/sites\/15\/2023\/03\/merge-sorting.png","contentUrl":"https:\/\/vmlogger.com\/algorithms\/wp-content\/uploads\/sites\/15\/2023\/03\/merge-sorting.png","width":1280,"height":720,"caption":"Merge Sort Algorithm"},{"@type":"BreadcrumbList","@id":"https:\/\/vmlogger.com\/algorithms\/2023\/03\/30\/merge-sort-in-python-the-ultimate-guide\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/vmlogger.com\/algorithms\/"},{"@type":"ListItem","position":2,"name":"Merge Sort in Python: The Ultimate Guide"}]},{"@type":"WebSite","@id":"https:\/\/vmlogger.com\/algorithms\/#website","url":"https:\/\/vmlogger.com\/algorithms\/","name":"Algorithms","description":"Welcome to the World of Algorithms","publisher":{"@id":"https:\/\/vmlogger.com\/algorithms\/#\/schema\/person\/7500a107b0b2d35a8492acf0d11fc8e5"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/vmlogger.com\/algorithms\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":["Person","Organization"],"@id":"https:\/\/vmlogger.com\/algorithms\/#\/schema\/person\/7500a107b0b2d35a8492acf0d11fc8e5","name":"Vishwamitra Mishra","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/vmlogger.com\/algorithms\/#\/schema\/person\/image\/","url":"https:\/\/vmlogger.com\/algorithms\/wp-content\/uploads\/sites\/15\/2023\/03\/welcome-1.png","contentUrl":"https:\/\/vmlogger.com\/algorithms\/wp-content\/uploads\/sites\/15\/2023\/03\/welcome-1.png","width":1963,"height":843,"caption":"Vishwamitra Mishra"},"logo":{"@id":"https:\/\/vmlogger.com\/algorithms\/#\/schema\/person\/image\/"},"description":"My name is Vishwamitra Mishra. Friends Call me Vishwa. I hold a Bachelor\u2019s Degree in Computer Science from D.A.V.V. Indore & currently working as a Technical Lead having over 7 years of experience.","sameAs":["http:\/\/www.learnexcelmacro.com","http:\/\/www.facebook.com\/vmlogger","https:\/\/x.com\/https:\/\/www.twitter.com\/learnexcelmacro","https:\/\/www.youtube.com\/c\/VMLogger"],"url":"https:\/\/vmlogger.com\/algorithms\/author\/vishwamitra\/"}]}},"_links":{"self":[{"href":"https:\/\/vmlogger.com\/algorithms\/wp-json\/wp\/v2\/posts\/333"}],"collection":[{"href":"https:\/\/vmlogger.com\/algorithms\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/vmlogger.com\/algorithms\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/vmlogger.com\/algorithms\/wp-json\/wp\/v2\/users\/45"}],"replies":[{"embeddable":true,"href":"https:\/\/vmlogger.com\/algorithms\/wp-json\/wp\/v2\/comments?post=333"}],"version-history":[{"count":10,"href":"https:\/\/vmlogger.com\/algorithms\/wp-json\/wp\/v2\/posts\/333\/revisions"}],"predecessor-version":[{"id":461,"href":"https:\/\/vmlogger.com\/algorithms\/wp-json\/wp\/v2\/posts\/333\/revisions\/461"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/vmlogger.com\/algorithms\/wp-json\/wp\/v2\/media\/341"}],"wp:attachment":[{"href":"https:\/\/vmlogger.com\/algorithms\/wp-json\/wp\/v2\/media?parent=333"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/vmlogger.com\/algorithms\/wp-json\/wp\/v2\/categories?post=333"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/vmlogger.com\/algorithms\/wp-json\/wp\/v2\/tags?post=333"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}