Refactor #1: The classic bubble sort, with a functional twist The original Sort application show below is far from functional.

For example, the complexity of sorting N numbers using the bubble sort method is O (N 2 ) and using merge sort method is O (N log N ). This doesn't mean we consume N 2 and N log N processor clock ...

It may not make much sense to do this right now, but it is vital to the way in which our Bubble Sort algorithm works. (The example in this article applies to SQL Server 2000 and later.) ...