A Simple Bubble Sort Function, glass houses

Doug Alan nessus at mit-eddie.UUCP
Mon Jun 11 22:11:54 AEST 1984


Yes.  And if you're too lazy to do a quick sort or merge sort or some
n*log(n) sort (though it shouldn't be very difficult) you could at LEAST
do a straight insertion sort which is just as easy as a bubble sort or
selection sort and always as fast or faster.
-- 
				-Doug Alan
				 mit-eddie!nessus
				 Nessus at MIT-MC

				"What does 'I' mean"?

 



More information about the Comp.sources.unix mailing list