<!DOCTYPE html>
<html data-require="math">
  <head>
    <title>Insertion Sort Question</title>
    <script src="//cdnjs.cloudflare.com/ajax/libs/require.js/2.1.14/require.min.js"></script>
    <script src="../../khan-exercises/local-only/main.js" ></script>
  </head>

  <body>
    <div class="exercise">
      <div class="problems">
        <div id="InssortTFstablep">
          <p class="problem">Answer TRUE or FALSE.
          <p class="question">
            Insertion Sort (as the code is written in this
            module) is a stable sorting algorithm. Recall that a stable sorting
            algorithm maintains the relative order of records with equal keys.</p>
          <div class="solution">True</div>
          <ul class="choices" data-category="true">
            <li>True</li>
            <li>False</li>
          </ul>
          <div class="hints">
            <p>Think of the behavior of every pass through the inner
              for loop of the insertion sort if keys are equal.</p>
          </div>
        </div>
      </div>
    </div>
  </body>
</html>

{'avg_line_length': 33.71875, 'max_line_length': 93, 'alphanum_fraction': 0.5727525486561631, 'licenses': ['MIT'], 'repository_name': 'Aarif1430/OpenDSA', 'path': 'Exercises/Sorting/InssortTFstable.html', 'size': 1079, 'lang': 'HTML'}