数据结构冒泡排序

#include <stdio.h>//本次只用到了这个头文件
#include <string.h>
#include <stdlib.h>
#include <conio.h>
#include<time.h>
void show(int arr[], int length) {
	for (int i = 0; i < length; i++)
		printf("%d->", arr[i]);
	printf("NULL\n");
}
void maopaoshengxu(int arr[], int length) {
	for (int i = 0; i < length-1; i++) {
		for (int j = 0 ; j < length-1-i; j++) {
			if (arr[j] > arr[j + 1]) {
				int z;
				z = arr[j + 1];
				arr[j + 1] = arr[j];
				arr[j] = z;
			}
		}
		show(arr, 6);
	}
}
void maopaojiangxu(int arr[], int length) {
	for (int i = 0; i < length - 1; i++) {
		for (int j = 0; j < length - 1 - i; j++) {
			if (arr[j] <arr[j + 1]) {
				int z;
				z = arr[j + 1];
				arr[j + 1] = arr[j];
				arr[j] = z;
			}
		}
		show(arr, 7);
	}
}

int main() {
	int arrs[6] = { 6,5,3,4,1,2 };
	int arrj[7] = { 2,1,4,3,5,6,5};
	printf("初始顺序为：\n");
	show(arrs, 6);
	printf("升序排序：\n");
	maopaoshengxu(arrs, 6);
	printf("初始顺序为：\n");
	show(arrj, 7);
	printf("降序排序：\n");
	maopaojiangxu(arrj, 7);
}