C语言实训周笔记(4)

查表函数的应用:

int FindValue(int* br, int n, int val)//index:-1
{
	assert(br != NULL);
	for (int i = 0; i < n; ++i)
	{
		if (br[i] == val)
		{
			return i;
		}
		else
		{
			return -1;
		}
	}
}

冒泡排序法:

知识模块:swap()函数、for循环、数组应用

思想基础:

(1)比较相邻的元素，如果这个元素大就往后移；

(2)比较下一组元素;

(3)重复上述操作;

(4)最终结果呈现排序正确;

理论实践:

#include <iostream>
#include <assert.h>
using namespace std;

void Print(int br[10])
void Print_Ar(int* br, int n)
{
	for (int i = 0; i < n; ++i)
	{
		printf("%d", br[i]);
	}
	printf("\n");
}
//1..100
void Init_Ar(int* br, int n)
{
	assert(br != NULL);
	int* table = new int[n + 1];
	for (int i = 0; i <= n; ++i) { table[i] = 0; }
	int i = 0;
	while (i < n)
	{
		int tmp = rand() % 100 + 1;
		if (table[tmp] == 0)
		{
			table[tmp] = 1;
			br[i] = tmp;
			++i;
		}
	}
	delete[]table;
}
void bubbleSort(int* br, int n)
{
	assert(br != NULL);
	for (int i = 1, j; i < n; ++i)
	{
		for (j = 0; j < n - i; ++j)
		{
			if (br[j] > br[j + 1])
			{
				int tmp = br[j];
				br[j] = br[j + 1];
				br[j + 1] = tmp;
			}
		}
	}
}