Compare sorting algorithms' performance: Difference between revisions

Content added Content deleted

Inline

@@ Line 10: / Line 10: @@
 Consider at least two different sorting function (different algorithms or/and different implementation of the same algorithm).
-For example, consider [[Bubble Sort]], [[Insertion sort]], [[Quick sort]] or/and implementations of [[Quick sort]] with different pivot selection mechanisms.
+For example, consider [[Bubble Sort]], [[Insertion sort]], [[Quicksort]] or/and implementations of [[Quick sort]] with different pivot selection mechanisms.
 Where possible, use existing implementations.
 Preliminary subtask:
-* [[Bubble Sort]], [[Insertion sort]], [[Quick sort]], [[Radix sort]], [[Shell sort]]
+* [[Bubble Sort]], [[Insertion sort]], [[Quicksort]], [[Radix sort]], [[Shell sort]]
 * [[Query Performance]]
 * [[Write float arrays to a text file]]