//
// main.c
// FirstProgram
//
// Created by Calvin Zang on 12-4-17.
// Copyright (c) 2012年 SYSU. All rights reserved.
//
#include <stdio.h>
#include <time.h>
#include <stdlib.h>
typedef int TYPE;
#define N 100
void insertionSort(TYPE A[], int n)
{
int i, j; TYPE key;
for(i = 1; i < n; ++i){
key = A[i];
j = i-1;
while(j>=0 && A[j] > key){
A[j+1] = A[j];
--j;
}
A[j+1] = key;
}
}
void insertionSortNonincreasing(TYPE A[], int n)
{
int i, j; TYPE key;
for(i = 1; i < n; ++i){
key = A[i];
j = i-1;
while(j>=0 && A[j] < key)
{
A[j+1] = A[j];
--j;
}
A[j+1] = key;
}
}
int main()
{
int A[N], i;
srand(time(NULL));
for(i = 0; i < N; ++i)A[i] = rand() % 100;
//insertionSort(A, N);
insertionSortNonincreasing(A, N);
for(i = 0 ; i < N; ++i)
{
printf("%d ", A[i]);
if((i+1)%10==0) printf("\n");
}
}
插入排序
最新推荐文章于 2023-09-23 17:47:53 发布