Sorting algorithm when already in order [duplicate]

Question

Which algorithm is fastest if an array is already sorted? Insertsort, Quicksort, or Mergesort?

//needmorecharactersformorecharactersneedmorecharacters

try searching. you'll love it.

Mitch Wheat
– Mitch Wheat

2016-02-12 02:27:22 +00:00
Commented Feb 12, 2016 at 2:27 — Mitch Wheat
– Mitch Wheat, Commented Feb 12, 2016 at 2:27

ljt12138 · Accepted Answer · 2016-02-12 04:38:19Z

0

bubble-sort with checking. like this....

for i = 1..n-1
  bool changed = false
  for j <- i+1..n
    if a[i] > a[j] then
      swap (a[i], a[j])
      changed = true
  if changed is false then
    break

answered Feb 12, 2016 at 4:38

ljt12138

352 bronze badges

Sign up to request clarification or add additional context in comments.

Collectives™ on Stack Overflow

Sorting algorithm when already in order [duplicate]

1 Answer 1

Comments

Linked

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

Comments

Linked

Related