Search - Articles
DevASP.NET for ASP.NET, VB.NET, XML and C# (C-Sharp) Developers Friday, December 15, 2017

Dev Articles
Search Directory
ASP.NET
VB.Net
C-Sharp
SQL Server
 


Home > Search > Sample Chapters > C-Sharp
Quick Sort        
Total Hits: 197  |  Today: 0 Author: en.csharp-online.net       Rating:  
Read Reviews | Write Review | Your Rating: 

The quick sort is an in-place, divide-and-conquer, massively recursive sort. As a normal person would say, it's essentially a faster in-place version of the merge sort. The quick sort algorithm is simple in theory, but very difficult to put into code. The recursive algorithm consists of four steps:
1. If there are one or less elements in the array to be sorted, return immediately.
2. Pick an element in the array to serve as a "pivot" point. (Usually the left-most element in the array is used.)
3. Split the array into two parts - one with elements larger than the pivot and the other with elements smaller than the pivot.


What's New at DevASP.Net
04/23  A Debug Stopwatch
04/23  The virtual bool bug
04/23  Application.EnableVisualStyles Bu..
04/23  The Process Async Reader Bug
04/23  Load a DBF into a DataTable
04/23  Weird Error: Unable to Validate D..
04/23  ASP.NET and jQuery to the Max
04/23  Fixing Error: "SetConfigurationSe..
04/23  Generics in .NET
04/23  Builder Design Pattern
04/23  Abstract Factory Design Pattern
04/23  Prototype Design Pattern
04/23  Bridge Design Pattern
04/23  Composite Design Pattern
04/23  Decorator Design Pattern
04/23  Validation in .NET Framework 4
04/23  Windows Phone 7: How to Encrypt C..
04/23  Text box to accept only number
04/23  Using the Raw Input API to Proces..
04/23  Study EVM (Earned Value Managemen..

DevASP.Net - Disclaimer - Privacy
2002-2010 DevASP.net