The Insertion Sort : Insertion Sort « Search Sort « C Tutorial

Home
C Tutorial
1.Language
2.Data Type
3.String
4.printf scanf
5.Operator
6.Statement
7.Array
8.Function
9.Structure
10.Pointer
11.Memory
12.Preprocessor
13.File
14.Data Structure
15.Search Sort
16.Wide Character String
17.assert.h
18.ctype.h
19.math.h
20.setjmp.h
21.signal.h
22.stdio.h
23.stdlib.h
24.string.h
25.time.h
26.wctype.h
C / ANSI-C
C++
C++ Tutorial
Visual C++ .NET
C Tutorial » Search Sort » Insertion Sort 
15.5.1.The Insertion Sort
#include <string.h>
  #include <stdio.h>
  #include <stdlib.h>

  /* The Insertion Sort. */
  void insert(char *items, int count)
  {

    register int a, b;
    char t;

    for(a=1; a < count; ++a) {
      t = items[a];
      for(b=a-1(b >= 0&& (t < items[b]); b--)
        items[b+1= items[b];
      items[b+1= t;
    }
  }


  int main(void)
  {

    char s[255];

    printf("Enter a string:");
    gets(s);
    insert(s, strlen(s));
    printf("The sorted string is: %s.\n", s);

    return 0;
  }
Enter a string:12
The sorted string is: 12.
15.5.Insertion Sort
15.5.1.The Insertion Sort
www.java2java.com | Contact Us
Copyright 2009 - 12 Demo Source and Support. All rights reserved.
All other trademarks are property of their respective owners.