Use the system quick sort : Quick sort « Data Structure Algorithm « C / ANSI-C

Home
C / ANSI-C
1.assert.h
2.Console
3.ctype.h
4.Data Structure Algorithm
5.Data Type
6.Development
7.File
8.Function
9.Language Basics
10.Macro Preprocessor
11.Math
12.math.h
13.Memory
14.Pointer
15.setjmp.h
16.signal.h
17.Small Application
18.stdio.h
19.stdlib.h
20.String
21.string.h
22.Structure
23.time.h
24.wctype.h
C Tutorial
C++
C++ Tutorial
Visual C++ .NET
C / ANSI-C » Data Structure Algorithm » Quick sortScreenshots 
Use the system quick sort

#include <stdio.h>
#include <stdlib.h>

int comp(const void *i, const void *j);

int main(void)
{
  int sort[100], i;

  /* set the array with random numer*/
  for(i = 0; i < 100; i++)
    sort[i] = rand();
  
  /* call the quick sort */
  qsort(sort, 100, sizeof(int), comp);

  for(i = 0; i < 100; i++)
    printf("%d\n", sort[ i ]);

  return 0;
}

int comp(const void *i, const void *j)
{
  return *(int*)i - *(int*)j;
}


           
       
Related examples in the same category
1.The Quicksort
2.A Quicksort for stringsA Quicksort for strings
3.A Quicksort for filesA Quicksort for files
4.How to use sysmtem quick sortHow to use sysmtem quick sort
5.Sort: quicksort: how to use qsort
6.Quick sort on two dimensional string arrayQuick sort on two dimensional string array
7.A Quicksort for structures of type address
www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.