按值排序---冒泡和选择

# include<stdio.h>
# include<stdlib.h>
# include<time.h>
using namespace std;
void sort_pop(int p[], int len);
void select_sort(int p[], int len);
int main()
{
	int data[10] = { 0 };
	srand(time(NULL));
	for (int i = 0; i < 10; i++)
		data[i] = rand() % 13;

	select_sort(data, 10);


	for (int i = 0; i < 10; i++)
		printf("%d\n", data[i]);
	return 0;
}

void sort_pop(int p[], int len)
{
	for (int i = 0; i < len - 1; i++)
	{
		for (int j = 0; j < len - 1 - i; j++)
		{
			if (p[j] < p[j + 1])
			{
				p[j] = p[j] ^ p[j + 1];
				p[j+1] = p[j] ^ p[j + 1];
				p[j] = p[j] ^ p[j + 1];
			}
		}
	}
}

void select_sort(int p[], int len)
{
	for (int i = 0; i < len - 1; i++)
	{
		for (int j = i + 1; j < len ; j++)
		{
			if (p[i] < p[j])
			{
				p[i] = p[i] ^ p[j];
				p[j] = p[i] ^ p[j];
				p[i] = p[i] ^ p[j];
			}
		}
	}
}