Jump to content

Insertion Sort

From Encyclopedia of Algorithms
Revision as of 18:54, 3 August 2026 by Aitzaz (talk | contribs) (Created page with "{{Infobox algorithm | name = Insertion sort | signature = <span class="eoa-proc">Insertion-Sort</span>(<span class="eoa-var">A</span>, <span class="eoa-var">n</span>) | code = # '''for''' <span class="eoa-var">i</span> = 2 '''to''' <span class="eoa-var">n</span> # {{I}}<span class="eoa-var">key</span> = <span class="eoa-var">A</span>[<span class="eoa-var">i</span>] # {{I}}<span class="eoa-var">j</span> = <span class="eoa-var">i</span> − 1 # {{I}}'''while''' <span c...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Insertion sort
<span class="eoa-proc">Insertion-Sort</span>(<span class="eoa-var">A</span>, <span class="eoa-var">n</span>)
  1. # 'for' <span class="eoa-var">i</span> = 2 'to' <span class="eoa-var">n</span>
  2. # <span style="display:inline-block; width:1.7em;"></span><span class="eoa-var">key</span> = <span class="eoa-var">A</span>[<span class="eoa-var">i</span>]
  3. # <span style="display:inline-block; width:1.7em;"></span><span class="eoa-var">j</span> = <span class="eoa-var">i</span> &minus; 1
  4. # <span style="display:inline-block; width:1.7em;"></span>'while' <span class="eoa-var">j</span> &gt; 0 'and' <span class="eoa-var">A</span>[<span class="eoa-var">j</span>] &gt; <span class="eoa-var">key</span>
  5. # <span style="display:inline-block; width:1.7em;"></span><span style="display:inline-block; width:1.7em;"></span><span class="eoa-var">A</span>[<span class="eoa-var">j</span> + 1] = <span class="eoa-var">A</span>[<span class="eoa-var">j</span>]
  6. # <span style="display:inline-block; width:1.7em;"></span><span style="display:inline-block; width:1.7em;"></span><span class="eoa-var">j</span> = <span class="eoa-var">j</span> &minus; 1
  7. # <span style="display:inline-block; width:1.7em;"></span><span class="eoa-var">A</span>[<span class="eoa-var">j</span> + 1] = <span class="eoa-var">key</span>