UBB/sort
1
0
Fork 0
Code Issues Pull Requests Releases 3 Activity

Clean up quicksort and add doc #18

Merged
cromer merged 1 commits from cleanquicksort into master 2018-11-14 20:12:12 -03:00
Conversation 1 Commits 1 Files Changed 1 +19 -11
1 changed files with 19 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files
Showing only changes of commit d0b5e27c17 - Show all commits

30
src/quick_sort.c
View File

@ -13,22 +13,30 @@
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
/**
* Usar el algoritmo de quick sort
* @param array El array a ordenar
* @param n El tamaño del array
*/
void quick_sort(int *array, int n) {
if(n<2)return;
if(n < 2) {
return;
}
int i;
int j;
int temp;
int pivote=array[n/2];
for(i=0,j=n-1;;i++,j--){
while(array[i] < pivote) i++;
while(array[j] > pivote) j--;
if(i>=j)break;
temp=array[i];
int pivote = array[n / 2];
for (i =0, j = n - 1;; i++, j--) {
while (array[i] < pivote) i++;
while (array[j] > pivote) j--;
if (i >= j) {
break;
}
temp = array[i];
array[i] = array[j];
array[j] = temp;
array[j] = temp;
}
quick_sort(array,i);
quick_sort(array+i,n-i);
quick_sort(array, i);
quick_sort(array + i, n - i);
}