We’ve refactored the original Sort application with a few functional programming features. Now we’re ready to write a completely functional Sort application.

Usually, we specify the complexity of an algorithm using the notation O (.), which indicate 'the order of'. For example, the complexity of sorting N numbers using the bubble sort method is O (N2) and ...

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.) ...