c数值分析c8-1.pdfVIP

330 Chapter 8. Sorting For small N one does better to use an algorithm whose operation count goes as a higher, i.e., poorer, power of N , if the constant in front is small enough. For N 20, roughly, the method of straight insertion (§8.1) is concise and fast enough. We include it with some trepidation: It is an N 2 algorithm, whose potential for misuse (by using it for too large an N ) is great. The resultant waste of computer time is so awesome, that we were tempted not to include any N 2 routine at all. We h r P C S t e 2 t a e o a will draw the line, however, at the inefficient N algorithm, beloved of elementary p d r p m : m y / a p / i r w b s i l computer science texts, called bubble sort. If you know what bubble sort is, wipe it w l s g e e i h p w f o t a . i