学步园

  终于开始接触排序了.实现可以理解,复杂度的分析对我来说很难.

/* 7-1-11-19-00.01.c -- 第七章第一题 */<br /> #include <stdio.h><br /> #include <stdlib.h></p> <p>#define SIZE 9</p> <p>typedef int Item ;</p> <p>int main (void) ;<br /> void insert_sort (Item * array, const int size) ;<br /> void print_array (const Item * const array, const int size) ;</p> <p>int main (void)<br /> {<br /> Item array[SIZE] = {3, 1, 4, 1, 5, 9, 2, 6, 5} ;<br /> int size = SIZE ;</p> <p> print_array (array, size) ;<br /> insert_sort (array, size) ;<br /> print_array (array, size) ;</p> <p> return 0 ;<br /> }</p> <p>void insert_sort (Item * array, const int size)<br /> {<br /> Item temp ;<br /> int ct_lin, position ;</p> <p> for (position = 1; position < size; position++)<br /> {<br /> temp = array[position] ;<br /> for (ct_lin = position; ct_lin > 0 && array[ct_lin - 1] > temp; ct_lin--)<br /> array[ct_lin] = array[ct_lin - 1] ;<br /> array[ct_lin] = temp ;<br /> }<br /> }</p> <p>void print_array (const Item * const array, const int size)<br /> {<br /> int ct ;</p> <p> for (ct = 0; ct < size; ct++)<br /> printf ("%d ", array[ct]) ;<br /> putchar ('/n') ;<br /> }