Quicksort was chosen because it is recognized as the fastest sorting algorithm, Bubble Sort because it is one of the most known, being very easy to remember, and the direct insertion sort was selected because is almost as simple to understand as BubbleSort, but provides a lower execution time.
The Bubble Sort algorithm proved to be the most inefficient, obtaining in java an average run-time / array of 1329.853091 microseconds, in C ++ an average run-time / vector of 3339.091910 microseconds, and in C# an average run-time / vector of 5591.868977 microseconds.
PROGRAMS AND THEIR INVARIANTS Row Program Name Invariants 1 Bubble Sort
On the other hand, for the bubble sort, insertion sort, and selection sort, the average accuracy rates of the two groups do not show significant difference.
By examining student use of the scaffolds recorded on the system, it was noted that the students did not use the scaffolds to learn easy sorting algorithms such as "bubble sort," but, rather, they used the scaffolds to guide them to learn complex sorting algorithms such as "quick sort." The results indicate that the SPSML-based systems are suitable for solving complex problems.
The simple average-case analysis of Insertion Sort (1-pass Shellsort), and similar analyses of Bubble sort
, stack-sort and queue-sort are given in the preliminary version of this paper [Jiang et al.
For example, as shown in Figure 1, [LO.sub.A] describes how bubble sort