C language selection, bubbling, insertion sorting algorithm

#include <stdio.h>

#pragma mark selection sorting algorithm

void Xuanze_array (int *array, int len)

{

for (int i = 0; i<len-1; i++) {

for (int j = i+1; j<len; j + +) {

if (Array[i]<array[j]) {

int temp = Array[i];

Array[i] = Array[j];

ARRAY[J] = temp;

}

}

}

}

#pragma mark bubble sorting algorithm

void Maopao_array (int *array, int len)

{

for (int i = 0; i<len-1; i++) {

for (int j = 0; j<len-i-1; j + +) {

if (Array[j]>array[j+1]) {

int temp = Array[j];

ARRAY[J] = array[j+1];

ARRAY[J+1] = temp;

ARRAY[J] = Array[j+1]-array[j];

ARRAY[J+1] = array[j+1]-array[j];

ARRAY[J] = Array[j+1]+array[j];

}

}

}

}

#pragma mark insertion sorting algorithm

void Insert_array (int *array, int len)

{

for (int i = 1; i<len; i++) {

int temp = Array[i];

int j = i-1;

while (Temp<array[j]) {

ARRAY[J+1] = Array[j];

j--;

if (j==-1) {

Break

}

}

ARRAY[J+1] = temp;

}

}

#pragma mark Traversal array

void Print_array (int *array, int len)

{

for (int i = 0; i<len; i++)

{

printf ("%d\t", Array[i]);

}

printf ("\ n");

}

int main ()

{

Define an array

int array[] = {24, 14, 8, 66, 3, 9, 22};

The length of an array of arrays

int len = sizeof (array)/sizeof (int);

Insert_array (array, len);

Maopao_array (array, len);

Xuanze_array (array, len);

Output array

Print_array (array, len);

return 0;

}

C language selection, bubbling, insertion sorting algorithm