Graphical Demo of Sorting Algorithms
for Windows CE

The program is written in BasiCE for Windows CE Handheld PCs. You need BasiCE in order to run it. BasiCE is a freeware BASIC interpreter, and it can be downloaded at this address. When the BasiCE interpreter is running you select the Load command to load Gr_sorts, and then you select the Run command.

The idea is to display an array of elements to be sorted as points on the screen. The elements are the numbers from 1 up to the number of elements in the array. Imagine that the x-axis is the position in the array, and the y-axis is the value of the element. When sorted, position 1 should hold the value 1, position 2 the value 2, and so on. These points (1,1), (2,2), etc. will then form a oblique line from the bottom left to the top right. When completely unsorted, the points will appear to be placed randomly on the screen.

This is a screenshot of the sorted array:

And this is an unordered array:

Here we have bubble sort working:

The following sorting algorithms are supported:

• Bubble Sort
• Shaker Sort (a sort of two-ways Bubble Sort)
• Insertion Sort
• Heap Sort
• Merge Sort
• Shell Sort
• Quicksort

Download here (7 KB).

Visitors to this page:

[Back to Home Page]