3 Dec
2001
3 Dec
'01
7:09 a.m.
-----Original Message-----
From: Dave McGuire [mailto:mcguire@neurotica.com]
The "bubble sort" is a classic sorting
algorithm. That's probably
the algorithm the programmer used to sort the list of files.
By way of description Standish says in "Data Structure Techniques:"
"Let A[1:n] be an array of n numbers.
...
Make repeated sweeps over the array A[1:n] from left to right. Upon
detecting any adjacent pair of numbers A[i] and A[i+1] not in proper order,
exchange them A[i] <-> A[i + 1]. When a pass is completed with no exchanges
having been made, the process terminates.
"
I believe it's called bubble sort because the lesser numerical values tend
to "bubble up" to the top of the array.
Regards,
Chris
Christopher Smith, Perl Developer
Amdocs - Champaign, IL
/usr/bin/perl -e '
print((~"\x95\xc4\xe3"^"Just Another Perl
Hacker.")."\x08!\n");
'