Stick with algos. that are considerably different than the existing ones, don't just add insertion and selection sort when bubble sort is already there.
Try non-comparison sort (radix, gravity/bead, etc)
Maybe bogosort as a joke, although a redraw of the array would be necessary since I probably don't want to go over 7 or 8 elements at the most.
Stick with algos. that are considerably different than the existing ones, don't just add insertion and selection sort when bubble sort is already there.
Try non-comparison sort (radix, gravity/bead, etc)
Maybe bogosort as a joke, although a redraw of the array would be necessary since I probably don't want to go over 7 or 8 elements at the most.