HI,

can I mither again, for a few opinions?
Bubble-Sort v Selection Sort.

"Bubblesort is adaptive, Selection is Non-Adaptive."


Am I on the right track by saying Bubble is adaptive as it can break out of the loop if no exchanges are made at at point ion the loop
whereas Selection sort has to run through N-1 and cannot break out if no swap is made

If this is worng, can anyone expand in plain old english.


Also which is most effective/effecient?

I'm thinkign selection is more effecient
I have these points upto now.

Selection:
Despite it’s simplicity, selection sort outperforms more sophisticated methods in one important application:
It is THE choice method for sorting files with HUGE ITEMS and SMALL KEYS.
For such applications, the cost of moving the data dominates the cost of making comparisons and no algorithm can sort a file with
substantially less data movement than selection sort.

These are my revision notes. Hate exams