{"componentChunkName":"component---src-templates-blog-post-jsx","path":"/blogs/introductionToAlgorithms","result":{"data":{"blog":{"frontmatter":{"title":"INTRODUCTION TO ALGORITHMS","thumbnail":"blog51","date":"March 19, 2021","dsaCppCodeFile":null},"excerpt":"<div class=\"my-2 p-2\">\n              <h4>Definition</h4>\n              <div class=\"m-2\">\n                <p>\n                  An <strong>algorithm</strong> is a sequence(step-by-step) of\n                  unambiguous instructions to solve a problem for obtaining a\n                  required output for any legitimate input in a finite amount of\n                  time.\n                </p>\n                <p>\n                  Algorithmics is more than a branch of computer science, it is\n                  the core of computer science and in all fairness can be said\n                  to be relevant to most of science, business, and technology.\n                </p>\n                <p>\n                  Reason for studying algorithms is their usefulness in\n                  developing analytical skills. After all, algorithms can be\n                  seen as special kinds of solutions to problems. It is like the\n                  mixture of mathematics and programming.\n                </p>\n              </div>\n            </div>\n            <div class=\"my-2 p-2\">\n              <h4>Simple Example</h4>\n              <p class=\"pl-2 my-0\">\n                <strong>Algorithm to find the sum of two numbers.</strong>\n              </p>\n              <ol class=\"pl-4\">\n                <li>Start</li>\n                <li>Read num1, num2</li>\n                <li>sum = num1+num2</li>\n                <li>Display sum</li>\n                <li>Stop</li>\n              </ol>\n            </div>\n            <div class=\"my-2 p-2\">\n              <h4>Important points about Algorithms</h4>\n              <ul class=\"pl-4\">\n                <li>\n                  The non-ambiguity requirement for each step of an algorithm\n                  cannot be compromised.\n                </li>\n                <li>\n                  The range of inputs for which an algorithm works has to be\n                  specified carefully.\n                </li>\n                <li>\n                  There maybe more than one algorithm for solving the same\n                  problem.\n                </li>\n                <li>The same algorithm can be implemented in several ways.</li>\n                <li>\n                  Algorithms for the same problem can be based on different\n                  ideas and can solve the problem with dramatically different\n                  speeds.\n                </li>\n              </ul>\n            </div>\n            <div class=\"my-2 p-2\">\n              <h4>Characteristics</h4>\n              <ol class=\"pl-4\">\n                <li><strong>Inputs: </strong>0 or more no. of inputs</li>\n                <li><strong>Outputs: </strong>1 or more no. of outputs</li>\n                <li>\n                  <strong>Unambiguity: </strong>Clear &amp; Simple instructions.\n                </li>\n                <li>\n                  <strong>Finiteness: </strong>Limited no. of instructions/steps\n                  to solve the problem\n                </li>\n                <li>\n                  <strong>Effectiveness: </strong>Each instruction has an impact\n                  on overall process.\n                </li>\n              </ol>\n            </div>\n            <div class=\"my-2 p-2\">\n              <h4>Notion of an Algorithm</h4>\n              <div class=\"row m-2\">\n                <div class=\"col-md-6 my-2\">\n                  <span class=\"gatsby-resp-image-wrapper\" style=\"position: relative; display: block; margin-left: auto; margin-right: auto; max-width: 455px; \">\n      <span class=\"gatsby-resp-image-background-image\" style=\"padding-bottom: 56.75675675675676%; position: relative; bottom: 0; left: 0; background-image: url(&apos;data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAABQAAAALCAYAAAB/Ca1DAAAACXBIWXMAABJ0AAASdAHeZh94AAAA/0lEQVQoz6VSCW6EMAzk/19kF7TdiiMpOTgChGPqZC/EQqlaSxbIsSczngTYiXmen99pmnwua3sR7IE9hqRU+LhccDpFaBrzP8BHtm2LruveLvs14B32OdgTmLX2kN0BIBayJaqq+jvgUhbLM4RhiHMcQyp1vMP1vtZOOrlaaxhjMI7jZs9yNtgyYc1gGAYP9pNxt7wz3Ar37py77rwoCpSlpv9bzZ3tGekZKiWR067aroftey8xTVP/VDhjiM4RZQzOv2AIUNEuneuuT0pBvRkY4y/JdV1BCAFL0obB0gNuPJBjw7IcSZLgev2kGve7LAnIrcH11eS+KARdoj3Hb5HgYaCLviA9AAAAAElFTkSuQmCC&apos;); background-size: cover; display: block;\"></span>\n  <img class=\"gatsby-resp-image-image\" alt=\"Notion of an Algorithm\" title=\"Notion of an Algorithm\" src=\"/static/6025a2d6f738a003bf8ba7d8d6220eac/379c3/algo-notion.png\" srcset=\"/static/6025a2d6f738a003bf8ba7d8d6220eac/12f09/algo-notion.png 148w,\n/static/6025a2d6f738a003bf8ba7d8d6220eac/e4a3f/algo-notion.png 295w,\n/static/6025a2d6f738a003bf8ba7d8d6220eac/379c3/algo-notion.png 455w\" sizes=\"(max-width: 455px) 100vw, 455px\" style=\"width:100%;height:100%;margin:0;vertical-align:middle;position:absolute;top:0;left:0;\" loading=\"lazy\">\n    </span>\n                </div>\n                <div class=\"col-md-6 my-2 pl-4\">\n                  <ul>\n                    <li>First we look into the problem.</li>\n                    <li>\n                      We write an algorithm for the problem and feed it into the\n                      computer.\n                    </li>\n                    <li>\n                      We then provide inputs to check the correctness of the\n                      algorithm.\n                    </li>\n                    <li>\n                      Finally we get the output/s based on how the algorithm was\n                      written.\n                    </li>\n                  </ul>\n                </div>\n              </div>\n            </div>\n            <div class=\"my-2 p-2\">\n              <h4>Design and Analysis of Algorithms</h4>\n              <div class=\"m-2\">\n                <div class=\"my-2 text-center\">\n                <span class=\"gatsby-resp-image-wrapper\" style=\"position: relative; display: block; margin-left: auto; margin-right: auto; max-width: 590px; \">\n      <span class=\"gatsby-resp-image-background-image\" style=\"padding-bottom: 111.48648648648648%; position: relative; bottom: 0; left: 0; background-image: url(&apos;data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAABQAAAAWCAYAAADAQbwGAAAACXBIWXMAABJ0AAASdAHeZh94AAACAklEQVQ4y41VB5LCMAzM/99ICYQAIZWWQtNpBZvRhcCdZwTGlterlSwCcePxeNj37XaT8/ksVVVJkRdSFqUUZoVZU9fSdd2vMxzBGOD1epVaD+HwLtk9bZdKqrZLU2ma5n+A3sE74gKw/ubTA/pNzu/3u7Fo29bADvu9HI9HA8Vaq3tYH57DdzBcJKPL5WLAh8NBFuFC4jiWvQIDFL4A9ox5PvBA0AWO0O6oQKnqFUUrmU6mslwsFTiU9Xojp9NJ8jw3X1zsQXsN/SZYZFkmEwUCQDiby0IBo2Uks+lcL8r6pOAM5z1D6OVFR6imlRqckfH6VSo0akiJKEGAwxR8mG3K0Y2E5gcAIYOFDEDc6KnbjU3bZ7oqS7WqZ+3l4RxmgGDmgbCBpCBEMEcykm1iWYaOVbU3f2gMX4aOtSdDALbdW4GymKknDmCONewNwx5l+ElDz2RYyN6n1xDhMVxmDPqhCeQa2na7lXW8tjDRNLoXY//8ekB8ANQbNtlRSk1IqQkpX53Gl88ooHwY1IuCM2ReynBHGQ43yZq/m7r59Xb93ltSxloXNk9aMpm+ZTSGKIoknIc2T5JEdXyWFFizhnHhR0Ar9lcBQzO8AhjmbK5k5CX42mD9YD3+Nb4y9E8P2cXzY3Nl4/W1+Na+hv8prMXNZqP/J4msVrHVIrXDhWMR/QAS070mgxe/ugAAAABJRU5ErkJggg==&apos;); background-size: cover; display: block;\"></span>\n  <img class=\"gatsby-resp-image-image\" alt=\"Design and Analysis of Algorithms\" title=\"Design and Analysis of Algorithms\" src=\"/static/bf39cfad01bbde5f7bf906db654f54f3/fcda8/algo-design-analysis.png\" srcset=\"/static/bf39cfad01bbde5f7bf906db654f54f3/12f09/algo-design-analysis.png 148w,\n/static/bf39cfad01bbde5f7bf906db654f54f3/e4a3f/algo-design-analysis.png 295w,\n/static/bf39cfad01bbde5f7bf906db654f54f3/fcda8/algo-design-analysis.png 590w,\n/static/bf39cfad01bbde5f7bf906db654f54f3/0012b/algo-design-analysis.png 661w\" sizes=\"(max-width: 590px) 100vw, 590px\" style=\"width:100%;height:100%;margin:0;vertical-align:middle;position:absolute;top:0;left:0;\" loading=\"lazy\">\n    </span>\n                </div>\n                <div class=\"my-2 pl-4\">\n                  <ol>\n                    <li>\n                      The first thing you need to do before designing an\n                      algorithm is to understand completely the problem given.\n                      Read the problem&#x2019;s description carefully and do a few\n                      small examples by hand, think about special cases.\n                    </li>\n                    <li>\n                      Once you completely understand a problem, you need to\n                      ascertain the capabilities of the computational device the\n                      algorithm is intended for. The next principal decision is\n                      to choose between solving the problem exactly or solving\n                      it approximately.\n                    </li>\n                    <li>\n                      An algorithm design technique is a general approach to\n                      solving problems algorithmically that is applicable to a\n                      variety of problems from different areas of computing.\n                      Design a simple algorithm that could approximately solve\n                      the problem.\n                    </li>\n                    <li>\n                      Prove the correctness by providing inputs of your own and\n                      try to get the required output. That is, you have to prove\n                      that the algorithm yields a required result for every\n                      legitimate input in a finite amount of time.\n                    </li>\n                    <li>\n                      We usually want our algorithms to possess several\n                      qualities and be more efficient. In fact, there are two\n                      kinds of algorithm efficiency:\n                      <strong>time efficiency</strong> (indicating how fast the\n                      algorithm runs) and\n                      <strong>space efficiency</strong> (indicating how much\n                      extra memory it uses).\n                    </li>\n                    <li>\n                      Finally, code the algorithm with your preferred\n                      programming language.\n                    </li>\n                  </ol>\n                </div>\n                 <div class=\"my-2 p-2\">\n                  <strong>Similar posts:</strong>\n                  <a href=\"/blogs/analysisOfAlgorithms\">Analysis of Algorithms</a> | <a href=\"/blogs/timeComplexity\">Time Complexity</a>\n                </div>\n              </div>\n            </div>\n","html":"<div class=\"my-2 p-2\">\n              <h4>Definition</h4>\n              <div class=\"m-2\">\n                <p>\n                  An <strong>algorithm</strong> is a sequence(step-by-step) of\n                  unambiguous instructions to solve a problem for obtaining a\n                  required output for any legitimate input in a finite amount of\n                  time.\n                </p>\n                <p>\n                  Algorithmics is more than a branch of computer science, it is\n                  the core of computer science and in all fairness can be said\n                  to be relevant to most of science, business, and technology.\n                </p>\n                <p>\n                  Reason for studying algorithms is their usefulness in\n                  developing analytical skills. After all, algorithms can be\n                  seen as special kinds of solutions to problems. It is like the\n                  mixture of mathematics and programming.\n                </p>\n              </div>\n            </div>\n            <div class=\"my-2 p-2\">\n              <h4>Simple Example</h4>\n              <p class=\"pl-2 my-0\">\n                <strong>Algorithm to find the sum of two numbers.</strong>\n              </p>\n              <ol class=\"pl-4\">\n                <li>Start</li>\n                <li>Read num1, num2</li>\n                <li>sum = num1+num2</li>\n                <li>Display sum</li>\n                <li>Stop</li>\n              </ol>\n            </div>\n            <div class=\"my-2 p-2\">\n              <h4>Important points about Algorithms</h4>\n              <ul class=\"pl-4\">\n                <li>\n                  The non-ambiguity requirement for each step of an algorithm\n                  cannot be compromised.\n                </li>\n                <li>\n                  The range of inputs for which an algorithm works has to be\n                  specified carefully.\n                </li>\n                <li>\n                  There maybe more than one algorithm for solving the same\n                  problem.\n                </li>\n                <li>The same algorithm can be implemented in several ways.</li>\n                <li>\n                  Algorithms for the same problem can be based on different\n                  ideas and can solve the problem with dramatically different\n                  speeds.\n                </li>\n              </ul>\n            </div>\n            <div class=\"my-2 p-2\">\n              <h4>Characteristics</h4>\n              <ol class=\"pl-4\">\n                <li><strong>Inputs: </strong>0 or more no. of inputs</li>\n                <li><strong>Outputs: </strong>1 or more no. of outputs</li>\n                <li>\n                  <strong>Unambiguity: </strong>Clear &amp; Simple instructions.\n                </li>\n                <li>\n                  <strong>Finiteness: </strong>Limited no. of instructions/steps\n                  to solve the problem\n                </li>\n                <li>\n                  <strong>Effectiveness: </strong>Each instruction has an impact\n                  on overall process.\n                </li>\n              </ol>\n            </div>\n            <div class=\"my-2 p-2\">\n              <h4>Notion of an Algorithm</h4>\n              <div class=\"row m-2\">\n                <div class=\"col-md-6 my-2\">\n                  <span class=\"gatsby-resp-image-wrapper\" style=\"position: relative; display: block; margin-left: auto; margin-right: auto; max-width: 455px; \">\n      <span class=\"gatsby-resp-image-background-image\" style=\"padding-bottom: 56.75675675675676%; position: relative; bottom: 0; left: 0; background-image: url(&apos;data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAABQAAAALCAYAAAB/Ca1DAAAACXBIWXMAABJ0AAASdAHeZh94AAAA/0lEQVQoz6VSCW6EMAzk/19kF7TdiiMpOTgChGPqZC/EQqlaSxbIsSczngTYiXmen99pmnwua3sR7IE9hqRU+LhccDpFaBrzP8BHtm2LruveLvs14B32OdgTmLX2kN0BIBayJaqq+jvgUhbLM4RhiHMcQyp1vMP1vtZOOrlaaxhjMI7jZs9yNtgyYc1gGAYP9pNxt7wz3Ar37py77rwoCpSlpv9bzZ3tGekZKiWR067aroftey8xTVP/VDhjiM4RZQzOv2AIUNEuneuuT0pBvRkY4y/JdV1BCAFL0obB0gNuPJBjw7IcSZLgev2kGve7LAnIrcH11eS+KARdoj3Hb5HgYaCLviA9AAAAAElFTkSuQmCC&apos;); background-size: cover; display: block;\"></span>\n  <img class=\"gatsby-resp-image-image\" alt=\"Notion of an Algorithm\" title=\"Notion of an Algorithm\" src=\"/static/6025a2d6f738a003bf8ba7d8d6220eac/379c3/algo-notion.png\" srcset=\"/static/6025a2d6f738a003bf8ba7d8d6220eac/12f09/algo-notion.png 148w,\n/static/6025a2d6f738a003bf8ba7d8d6220eac/e4a3f/algo-notion.png 295w,\n/static/6025a2d6f738a003bf8ba7d8d6220eac/379c3/algo-notion.png 455w\" sizes=\"(max-width: 455px) 100vw, 455px\" style=\"width:100%;height:100%;margin:0;vertical-align:middle;position:absolute;top:0;left:0;\" loading=\"lazy\">\n    </span>\n                </div>\n                <div class=\"col-md-6 my-2 pl-4\">\n                  <ul>\n                    <li>First we look into the problem.</li>\n                    <li>\n                      We write an algorithm for the problem and feed it into the\n                      computer.\n                    </li>\n                    <li>\n                      We then provide inputs to check the correctness of the\n                      algorithm.\n                    </li>\n                    <li>\n                      Finally we get the output/s based on how the algorithm was\n                      written.\n                    </li>\n                  </ul>\n                </div>\n              </div>\n            </div>\n            <div class=\"my-2 p-2\">\n              <h4>Design and Analysis of Algorithms</h4>\n              <div class=\"m-2\">\n                <div class=\"my-2 text-center\">\n                <span class=\"gatsby-resp-image-wrapper\" style=\"position: relative; display: block; margin-left: auto; margin-right: auto; max-width: 590px; \">\n      <span class=\"gatsby-resp-image-background-image\" style=\"padding-bottom: 111.48648648648648%; position: relative; bottom: 0; left: 0; background-image: url(&apos;data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAABQAAAAWCAYAAADAQbwGAAAACXBIWXMAABJ0AAASdAHeZh94AAACAklEQVQ4y41VB5LCMAzM/99ICYQAIZWWQtNpBZvRhcCdZwTGlterlSwCcePxeNj37XaT8/ksVVVJkRdSFqUUZoVZU9fSdd2vMxzBGOD1epVaD+HwLtk9bZdKqrZLU2ma5n+A3sE74gKw/ubTA/pNzu/3u7Fo29bADvu9HI9HA8Vaq3tYH57DdzBcJKPL5WLAh8NBFuFC4jiWvQIDFL4A9ox5PvBA0AWO0O6oQKnqFUUrmU6mslwsFTiU9Xojp9NJ8jw3X1zsQXsN/SZYZFkmEwUCQDiby0IBo2Uks+lcL8r6pOAM5z1D6OVFR6imlRqckfH6VSo0akiJKEGAwxR8mG3K0Y2E5gcAIYOFDEDc6KnbjU3bZ7oqS7WqZ+3l4RxmgGDmgbCBpCBEMEcykm1iWYaOVbU3f2gMX4aOtSdDALbdW4GymKknDmCONewNwx5l+ElDz2RYyN6n1xDhMVxmDPqhCeQa2na7lXW8tjDRNLoXY//8ekB8ANQbNtlRSk1IqQkpX53Gl88ooHwY1IuCM2ReynBHGQ43yZq/m7r59Xb93ltSxloXNk9aMpm+ZTSGKIoknIc2T5JEdXyWFFizhnHhR0Ar9lcBQzO8AhjmbK5k5CX42mD9YD3+Nb4y9E8P2cXzY3Nl4/W1+Na+hv8prMXNZqP/J4msVrHVIrXDhWMR/QAS070mgxe/ugAAAABJRU5ErkJggg==&apos;); background-size: cover; display: block;\"></span>\n  <img class=\"gatsby-resp-image-image\" alt=\"Design and Analysis of Algorithms\" title=\"Design and Analysis of Algorithms\" src=\"/static/bf39cfad01bbde5f7bf906db654f54f3/fcda8/algo-design-analysis.png\" srcset=\"/static/bf39cfad01bbde5f7bf906db654f54f3/12f09/algo-design-analysis.png 148w,\n/static/bf39cfad01bbde5f7bf906db654f54f3/e4a3f/algo-design-analysis.png 295w,\n/static/bf39cfad01bbde5f7bf906db654f54f3/fcda8/algo-design-analysis.png 590w,\n/static/bf39cfad01bbde5f7bf906db654f54f3/0012b/algo-design-analysis.png 661w\" sizes=\"(max-width: 590px) 100vw, 590px\" style=\"width:100%;height:100%;margin:0;vertical-align:middle;position:absolute;top:0;left:0;\" loading=\"lazy\">\n    </span>\n                </div>\n                <div class=\"my-2 pl-4\">\n                  <ol>\n                    <li>\n                      The first thing you need to do before designing an\n                      algorithm is to understand completely the problem given.\n                      Read the problem&#x2019;s description carefully and do a few\n                      small examples by hand, think about special cases.\n                    </li>\n                    <li>\n                      Once you completely understand a problem, you need to\n                      ascertain the capabilities of the computational device the\n                      algorithm is intended for. The next principal decision is\n                      to choose between solving the problem exactly or solving\n                      it approximately.\n                    </li>\n                    <li>\n                      An algorithm design technique is a general approach to\n                      solving problems algorithmically that is applicable to a\n                      variety of problems from different areas of computing.\n                      Design a simple algorithm that could approximately solve\n                      the problem.\n                    </li>\n                    <li>\n                      Prove the correctness by providing inputs of your own and\n                      try to get the required output. That is, you have to prove\n                      that the algorithm yields a required result for every\n                      legitimate input in a finite amount of time.\n                    </li>\n                    <li>\n                      We usually want our algorithms to possess several\n                      qualities and be more efficient. In fact, there are two\n                      kinds of algorithm efficiency:\n                      <strong>time efficiency</strong> (indicating how fast the\n                      algorithm runs) and\n                      <strong>space efficiency</strong> (indicating how much\n                      extra memory it uses).\n                    </li>\n                    <li>\n                      Finally, code the algorithm with your preferred\n                      programming language.\n                    </li>\n                  </ol>\n                </div>\n                 <div class=\"my-2 p-2\">\n                  <strong>Similar posts:</strong>\n                  <a href=\"/blogs/analysisOfAlgorithms\">Analysis of Algorithms</a> | <a href=\"/blogs/timeComplexity\">Time Complexity</a>\n                </div>\n              </div>\n            </div>"},"thumbnail":{"childImageSharp":{"fluid":{"tracedSVG":"data:image/svg+xml,%3csvg%20xmlns='http://www.w3.org/2000/svg'%20width='400'%20height='225'%20viewBox='0%200%20400%20225'%20preserveAspectRatio='none'%3e%3cpath%20d='M24%2090l-1%2012-1%208h11v-5l1-4%201%204c1%204%202%205%204%205h3v-9l-1-10c-2-1-3%200-3%203l-1%202-1-1c0-3-3-5-5-4-2%200-2%201-2%205l-1%206v-6c0-5%200-6-2-6h-2m23%201c-3%200-4%200-4%203l2%202c2%200%202%201%202%207%200%207%200%207%202%207%203%200%203%200%203-7s1-8%203-8%202-1%202-2c-1-3-2-3-10-2m16%200c-5%200-5%200-5%2010l-1%209h2c3%200%203%200%203-3l1-3%202%203c1%203%202%204%204%202s2-2%201-4c-2-2-2-3%200-4%202-3%201-8-1-9l-3-2-3%201m12%201c-3%204-4%2013-1%2016%204%204%209%202%2011-5%201-3%201-3%201%202s0%205%203%205c4%200%208-2%2010-6l1-3v3c0%207%2010%209%2013%202%201-3%201-3%202-1%202%205%206%207%2011%202%202-2%202-2%201-4-1-1-2-1-3%201l-3%201c-2-1-1-7%200-9%202-1%202-1%202%201%200%201%201%202%203%202l2-1c0-1%201-2%203-2s2%200%202%207%200%207%203%207c2%200%202%200%202-4%200-8%201-11%203-11l2-2c0-3-1-3-8-2-5%200-6%201-6%202v3l-1-3c-2-5-10-3-13%203l-1%204v-5c0-4%200-4-2-4-3%200-3%200-3%205%200%207-1%209-3%209l-1-7c1-7%201-7-1-7s-3%201-3%203l-1%204-1-3c-1-4-4-5-9-4-3%200-3%200-3%205v5l-1-4c-3-7-7-9-11-5m70-2l-1%2012-1%208h2l4-2c0-2%200-2%202%200%205%205%2011%200%2011-9%200-10-9-12-12-3-1%201-1%200-1-2%200-3%200-4-2-4h-2m21%201c-1%200-2%202-2%207-1%2011-1%2012%201%2012%203%200%203%200%203-5l1-4%201%204c1%204%202%205%204%205h3v-9c0-8%200-10-2-10-1-1-1%200-2%202l-2%204v-3c-1-3-2-4-5-3m24%200c-3%200-4%200-4%203l2%202c2%200%202%201%202%207%200%207%200%207%203%207%202%200%202%200%202-7%200-8%200-8%203-8%202%200%202%200%202-2-1-3-2-3-10-2m13%201c-3%204-4%2013-1%2016%205%205%2011%200%2011-9%201-8-5-12-10-7m96%2014l-1%208v7h9c8%200%209%201%209%203s0%202-2%202c-5-1-16%2013-21%2026l-3%2020%206-7c4-5%206-7%2010-8%206-3%206-2%206%201%200%202%200%202%201%201h3l-2-5-2-7-1-3v-3c3-2%2013-2%2013%200l-2%201-2%201h6l-1%202-1%203-2%207-2%204h3c2%200%202-1%201-3%200-2%200-2%207%200%204%201%205%202%207%205l3%204%201%203%202%206%202%204%201%204c2%207-1%2010-9%208h-4v-24h-15v-3l-1-3-1%203v3h-17v7c0%205%200%207-2%208v3c2%200%203%204%202%206l-8%201c-5%200-6%200-8-3-1-2-1-2%201-6%204-6%203-7-1-2-3%203-4%205-4%207%200%203%200%203-9%204-9%200-9%200-9%202s1%203%205%203h5l-1%204v3h97l1-4c1-2%202-3%205-3%205-1%205-4%200-5h-3v-14c0-14-1-21-4-21l-2-2c-1-2-1-2-1%200%200%203-8%203-8-1%200-2%200-2%202-2%202%201%203%200%201-1-2-2-1-4%203-12%206-11%205-17-1-20l-3-2-1-1-1-4-1-5c-1-1-1%201-1%204v5l-3-1c-3-1-22%200-24%201-1%201-1-1-1-4v-5l-14-1-13%201m2%207v7h22v-3l1-3v-1l-1-3v-3h-22v6M27%20127l-3%2010-2%205h3l3-1c1-3%204-2%205%200l2%202c3-1%203-5%201-15-1-4-2-5-4-5-3%200-3%200-5%204m13-3l-1%209v9h6c5%200%206%200%206-2h1c3%205%2013%201%2012-5-1-4-7-4-6%200l-1%203v-8c0-2%202-2%202%200l3%201c2%200%202%200%202-3%200-9-12-5-13%204%200%205%200%205-4%205h-3v-7c0-6%200-7-2-7l-2%201m27%202c-2%203-3%2012-1%2014%202%203%207%203%209%200%203-3%204-12%201-15-2-3-6-3-9%201m14-2l-2%209c0%209%200%209%202%209l2-2c0-4%202-4%203-1%202%203%203%203%205%202v-3c-1-2-1-4%201-7v-6c-2-2-8-3-11-1m14%200v1l-1%2017c5%200%205%200%205-6l1-7%203-1v6c0%208%200%209%203%208%202%200%202-1%203-7%200-6%201-7%202-7l2-3c0-2-1-2-10-2-6%200-9%200-8%201m20%201l-1%2017c3%201%205%200%205-3l1-4h2v3c0%204%200%204%203%204h3v-9c0-10%200-10-2-10-3%200-3%200-3%204%200%202%200%203-2%203s-2%200-2-3c1-4%201-4-1-4s-3%201-3%202m15-1v18c1%201%204%200%204-2s0-2%202%200h3c1-2%201-2%201%200s4%204%205%202v-10c0-7-1-9-2-9-2%200-3%201-4%204l-2%204-1-4c-2-4-4-5-6-3m19%201c-3%202-3%206%201%209s4%204%200%204c-3-1-5%201-3%203h10c2-2%201-7-2-9s-4-5-2-5l1%202%202%201%202-2c0-5-4-6-9-3m121%2016l1%209h12v-18h-13v9m3%2023l-1%205c0%203%200%204-1%203%200-4-2-3-3%200l2%204%202%203%203%201c2%200%202%200%202-3%200-2%200-3%202-3s2-1%202-4l-1-4-1%203c0%204-2%203-2-2-1-3-1-4-4-3'%20fill='%23d3d3d3'%20fill-rule='evenodd'/%3e%3c/svg%3e","aspectRatio":1.7699115044247788,"src":"/static/36ccdd76d23b3ed8dce7dc4202a303f7/ee604/blog51.png","srcSet":"/static/36ccdd76d23b3ed8dce7dc4202a303f7/69585/blog51.png 200w,\n/static/36ccdd76d23b3ed8dce7dc4202a303f7/497c6/blog51.png 400w,\n/static/36ccdd76d23b3ed8dce7dc4202a303f7/ee604/blog51.png 800w,\n/static/36ccdd76d23b3ed8dce7dc4202a303f7/f3583/blog51.png 1200w,\n/static/36ccdd76d23b3ed8dce7dc4202a303f7/e4d72/blog51.png 1280w","sizes":"(max-width: 800px) 100vw, 800px"}}}},"pageContext":{"blog":"introductionToAlgorithms","thumbnail":"thumbnails/blog51.png"}},"staticQueryHashes":["2987289216","63159454"]}