ClueBot NG Report Interface

// Report

Navigation

ID:1667243
User:5.146.64.34
Article:Insertion sort
Diff:
(Best, worst, and average cases)
(Tag: possible vandalism)
Line 11: Line 11:
 
}}
 
}}
   
  +
IHR SOLLTET NICHT ALLES BEI WIKIPEDIA NACHSCHLAGEN!!!
 
'''Insertion sort''' is a simple [[sorting algorithm]] that builds the final [[sorted array]] (or list) one item at a time. It is much less efficient on large lists than more advanced algorithms such as [[quicksort]], [[heapsort]], or [[merge sort]]. However, insertion sort provides several advantages:
 
'''Insertion sort''' is a simple [[sorting algorithm]] that builds the final [[sorted array]] (or list) one item at a time. It is much less efficient on large lists than more advanced algorithms such as [[quicksort]], [[heapsort]], or [[merge sort]]. However, insertion sort provides several advantages:
   
Reason:ANN scored at 0.989749
Your username:
Reverted:Yes
Comment
(optional):

Note: Comments are completely optional. You do not have to justify your edit.
If this is a false positive, then you're right, and the bot is wrong - you don't need to explain why.