This page explains the concept of Array Sorts.
| Description |
Sample Code |
|
Selection Sort
Selection sort is a fairly easy concept. Say you want to place the array in
ascending order, selection sort will find the smallest number and place it at the front of the array, then find the next
hightest number and place it in the second spot of the array and so on. Though this is a simple concept it can be difficalt
for some to write.
|
 |
|
Insertion Sort
This sort works by repeatedly "inserting," thus Insertion, new element into a sublist that is already sorted.
This is continued untill the entire list is sorted.
|
 |
