C语言经典编程实例（五）

最新推荐文章于 2022-04-06 23:47:53 发布

K-U-I

最新推荐文章于 2022-04-06 23:47:53 发布

阅读量311

点赞数 1

分类专栏： C/C++ 文章标签： C语言经典编程实例（五）

本文链接：https://blog.csdn.net/kuisi95/article/details/98256496

版权

C/C++ 专栏收录该内容

29 篇文章 4 订阅

订阅专栏

文章目录

- - - - 一、C语言基础
      - 1.希尔排序
        2.冒泡排序
        3.插入排序
        4.快速排序
        5.选择排序
        6.归并排序
        7.二分查找，折半查找
        8.分块查找
        9.n的阶乘
        10.求1+2+3+...+n

使用C++语言解决C语言常见重点、要点问题

一、C语言基础

1.希尔排序

用希尔排序法对一组数据由小到大进行排序


//1.用希尔排序法对一组数据由小到大进行排序
void Hill_Sort()
{
	vector<int> num;
	int n = 0;
	int count = 0;
	num.push_back(0);

	cout << "Please input the count of number: ";
	cin >> count;

	int tmp = count;
	cout << "Please input a number: ";
	while (cin >> n)
	{
		tmp--;
		num.push_back(n);

		if (tmp == 0)
			break;
		cout << "Please input a number: ";
	}

	int i = 0;
	int j = 0;
	int d = count / 2;
	while (d >= 1)
	{
		for (i = d + 1; i <= count; i++)
		{
			num[0] = num[i];
			j = i - d;
			while ((j > 0) && (num[0] < num[j]))
			{
				num[j + d] = num[j];
				j = j - d;
			}
			num[j + d] = num[0];
		}
		d = d / 2;
	}

	cout << "The new number is: ";
	for (i = 1; i <= count; i++)
	{
		cout << ' ' << num[i];
	}
	cout << endl;
}

2.冒泡排序

冒泡排序

注意每一趟以及每一趟的比较次数

/
//2.冒泡排序
void Bubble_Sort()
{
	vector<int> num;
	int n = 0;
	int count = 0;
	num.push_back(0);

	cout << "Please input the count of number: ";
	cin >> count;

	int tmp = count;
	cout << "Please input a number: ";
	while (cin >> n)
	{
		tmp--;
		num.push_back(n);

		if (tmp == 0)
			break;
		cout << "Please input a number: ";
	}

	int i = 0;
	int j = 0;
	for(i = 1;i < num.size() - 1;i++)//比较趟数
		for (j = 1; j < num.size() - i; j++)//每一趟比较次数
		{
			if (num[j] > num[j + 1])
				swap(num[j], num[j + 1]);
		}

	cout << "The new number is: ";
	for (i = 1; i <= count; i++)
	{
		cout << ' ' << num[i];
	}
	cout << endl;
}

3.插入排序

插入排序是把一个记录插入到已排序的有序序列中，使整个序列在插入该记录后仍然有序。插入排序中较简单的种方法是直接插入排序，其插入位置的确定方法是将待插入的记录与有序区中的各记录自右向左依次比较其关键字值的大小。本实例要求使用直接插入排序法将数字由小到大进行排序

/
//3.插入排序是把一个记录插入到已排序的有序序列中，使整个序列在插入该记录后仍然有序。插入排序中较简单的种方法是
//直接插入排序，其插入位置的确定方法是将待插入的记录与有序区中的各记录自右向左依次比较其关键字值的大小。
//本实例要求使用直接插入排序法将数字由小到大进行排序
void Insert_Sort()
{
	vector<int> num;
	int n = 0;
	int count = 0;
	num.push_back(0);

	cout << "Please input the count of number: ";
	cin >> count;

	int tmp = count;
	cout << "Please input a number: ";
	while (cin >> n)
	{
		tmp--;
		num.push_back(n);

		if (tmp == 0)
			break;
		cout << "Please input a number: ";
	}
	int i = 0;
	int j = 0;
	for (i = 2; i <= num.size() - 1; i++)
	{
		num[0] = num[i];
		j = i - 1;
		while (num[0] < num[j])
		{
			num[j + 1] = num[j];
			j--;
		}

		num[j + 1] = num[0];
	}

	cout << "The new number is: ";
	for (i = 1; i <= count; i++)
	{
		cout << ' ' << num[i];
	}
	cout << endl;

}

4.快速排序

用快速排序法对一组数据由小到大进行排序

/
//4.用快速排序法对一组数据由小到大进行排序
int quick_sort(vector<int>& n, int start, int end)
{
	int i = start;	
	int j = end;
	n[0] = n[start];

	while (i < j)
	{
		while (i < j && n[0] < n[j])
			j--;
		if (i < j)
		{
			n[i] = n[j];
			i++;
		}

		while (i < j && n[i] <= n[0])
			i++;
		if (i < j)
		{
			n[j] = n[i];
			j--;
		}

		n[i] = n[0];
		if (start < i)
			quick_sort(n, start, j - 1);
		if (i < end)
			quick_sort(n, j + 1, end);

		}

	return 0;
}

void Quick_Sort()
{
	vector<int> num;
	int n = 0;
	int count = 0;
	num.push_back(0);

	cout << "Please input the count of number: ";
	cin >> count;

	int tmp = count;
	cout << "Please input a number: ";
	while (cin >> n)
	{
		tmp--;
		num.push_back(n);

		if (tmp == 0)
			break;
		cout << "Please input a number: ";
	}

	quick_sort(num, 1, num.size() - 1);

	
	cout << "The new number is: ";
	for (int i = 1; i <= count; i++)
	{
		cout << ' ' << num[i];
	}
	cout << endl;
}

5.选择排序

选择排序

/
//5.选择排序
void ChooseSort()
{
	vector<int> num;
	int n = 0;
	int count = 0;
	num.push_back(0);

	cout << "Please input the count of number: ";
	cin >> count;
	int tmp = count;
	cout << "Please input a number: ";
	while (cin >> n)
	{
		tmp--;
		num.push_back(n);

		if (tmp == 0)
			break;
		cout << "Please input a number: ";
	}

	for (int i = 1; i < num.size() - 1; i++)
	{
		for (int j = i + 1; j < num.size(); j++)
		{
			if (num[i] > num[j])
				swap(num[i], num[j]);
		}
	}


	cout << "The new number is: ";
	for (int i = 1; i <= count; i++)
	{
		cout << ' ' << num[i];
	}
	cout << endl;
}

6.归并排序

/
//6.归并排序
int  merge(int r[], int s[], int x1, int x2, int x3)
{
	int i = 0, j = 0, k = 0;
	i = x1;
	j = x2 + 1;
	k = x1;

	while ((i <= x2) && (j <= x3))
	{
		if (r[i] <= r[j])
		{
			s[k] = r[i];
			i++;
			k++;
		}
		else
		{
			s[k] = r[j];
			j++;
			k++;
		}
	}
	while (i <= x2)
		s[k++] = r[i++];
	while (j <= x3)
		s[k++] = r[j++];
	
	return 0;
}
int mergesort(int r[], int s[], int m, int n)
{
	int p;
	int tmp[COUNT * 2];
	if (m == n)
		s[m] = r[m];
	else
	{
		p = (m + n) / 2;
		mergesort(r, tmp, m, p);
		mergesort(r, tmp, p + 1, n);
		merge(tmp, s, m, p, n);
	}

	return 0;
}

void Merge_sort()
{
	int n = 0;
	int num[COUNT + 1];
	num[0] = 0;

	cout << "Please input " << COUNT << " number" << endl;
	for (int i = 1; i < COUNT + 1; i++)
	{
		cout << "Please input a number: ";
		cin >> n;
		num[i] = n;
	}
	
	mergesort(num, num, 1, COUNT);

	cout << "The new Array is:";
	for (int i = 1; i <= COUNT; i++)
	{
		cout << ' ' << num[i];
	}
	cout << endl;
}

7.二分查找，折半查找

二分查找，折半查找

//
//7.二分查找，折半查找
void binarysearch(int key, vector<int>& n, int s)
{
	int start = 0;
	int end = s - 1;
	int count = 0;//查找次数
	int midd = (start + end) / 2;
	while (start <= end)
	{
		count++;
		if (key == n[midd])
		{
			cout << "Search Success! after " << count << " times looking num" << "[" << midd << "]" << key << endl;
			return;
		}
		else if (key < n[midd])
		{
			end = midd - 1;
		}
		else
		{
			start = midd + 1;
		}
		midd = (start + end) / 2;
	}

	cout << "Search Failed!" << endl;
}

void Binary_Search()
{
	vector<int> num;
	int n = 0;
	int count = 0;

	cout << "Please input the count of number: ";
	cin >> count;
	int tmp = count;
	cout << "Please input a number: ";
	while (cin >> n)
	{
		tmp--;
		num.push_back(n);

		if (tmp == 0)
			break;
		cout << "Please input a number: ";
	}

	cout << endl << endl;
	cout << "Please enter the number you are looking for: ";
	int da = 0;
	cin >> da;
	
	binarysearch(da,  num, num.size());
	cout << endl;
}

8.分块查找

分块查找，索引顺序查找


//8.分块查找，索引顺序查找
void Block_Search()
{
		
}

9.n的阶乘

n的阶乘

无论是递归还是非递归皆需要注意其终止条件

//
//9.n的阶乘
double _RFactorial(int n)
{
	if (n == 1)
	{
		return 1;
	}

	return n * _RFactorial(n - 1);
}
double _NRFactorial(int n)
{
	double sum = 1;
	for (int i = 1; i <= n; i++)
	{
		sum *= i;
	}
	return sum;
}

void Factorial()
{
	int n = 0;
	double result = 0;
	cout << "Please input a number: ";
	cin >> n;

	//递归
	result = _RFactorial(n);
	cout << "The result is : " << result << endl;
	result = 0;
	//非递归
	result =  _NRFactorial(n);
	cout << "The result is : " << result << endl;
}

10.求1+2+3+…+n

求1+2+3+…+n，要求不能使用乘除法、for、while、if、else、switch、case等关键字及条件判断语句（A?B:C）

利用内部类和外部类的关系以及构造函数的多次调用来完成题目

//
//10.求1+2+3+...+n，要求不能使用乘除法、for、while、if、else、switch、case等关键字及条件判断语句（A?B:C）
class Solution {
public:
	class Sum
	{
	public://内部类是外部类的友元类
		Sum()
		{
			sum += i;
			++i;
		}
	};

	int Sum_Solution(int n) {
		i = 1;
		sum = 0;

		Sum a[n];//调用n次构造函数
		return sum;
	}
private:
	static int sum;
	static int i;
};

int Solution::i = 1;
int Solution::sum = 0;