分享一下我老师大神的人工智能教程!零基础,通俗易懂!http://blog.csdn.net/jiangjunshow
也欢迎大家转载本篇文章。分享知识,造福人民,实现我们中华民族伟大复兴!
题目
解决代码及点评
- <code class="language-cpp">/*
- 堆排序
- */
- #include <stdio.h>
- #include <stdlib.h>
- #include <malloc.h>
- #include <time.h>
- void PrintArr(int *pnArr, int nLen)
- {
- for (int i = 0; i < nLen; i++)
- {
- printf("%d ", pnArr[i]);
- }
- printf("\n");
- }
- //返回i父节点下标
- int Parent(int i)
- {
- return (i - 1) / 2;
- }
- //返回i左孩子下标
- int LeftChild(int i)
- {
- return i * 2 + 1;
- }
- //返回i右孩子下标
- int RightChild(int i)
- {
- return i * 2 + 2;
- }
- void Swap(int *a, int *b)
- {
- int nTmp = *a;
- *a = *b;
- *b = nTmp;
- }
- void MaxHeapify(int *pnArr, int nLen, int i)
- {
- int LChild = LeftChild(i);
- int RChild = RightChild(i);
- int nMaxPos;
- if (LChild < nLen && pnArr[LChild] > pnArr[i])
- {
- nMaxPos = LChild;
- }
- else
- {
- nMaxPos = i;
- }
- if (RChild < nLen && pnArr[RChild] > pnArr[nMaxPos])
- {
- nMaxPos = RChild;
- }
- if (nMaxPos != i)
- {
- Swap(&pnArr[nMaxPos], &pnArr[i]);
- MaxHeapify(pnArr, nLen,nMaxPos);
- }
- }
- void BuildMaxHeap(int *pnArr, int nLen)
- {
- for (int i = Parent(nLen -1); i >= 0; i--)
- {
- MaxHeapify(pnArr, nLen, i);
- }
- }
- void HeapSort(int *pnArr, int nLen)
- {
- BuildMaxHeap(pnArr, nLen);
- for (int i = nLen - 1; i > 0; i--)
- {
- Swap(&pnArr[i], &pnArr[0]);
- nLen--;
- MaxHeapify(pnArr, nLen, 0);
- }
- }
- int main()
- {
- int nArr[10] = {4,1,3,2,16,9,10,14,8,7};
- PrintArr(nArr, 10);
- HeapSort(nArr, 10);
- PrintArr(nArr, 10);
- system("pause");
- return 0;
- }</code>
/* 堆排序*/#include <stdio.h>#include <stdlib.h>#include <malloc.h>#include <time.h>void PrintArr(int *pnArr, int nLen){ for (int i = 0; i < nLen; i++) { printf("%d ", pnArr[i]); } printf("\n");}//返回i父节点下标int Parent(int i){ return (i - 1) / 2;}//返回i左孩子下标int LeftChild(int i){ return i * 2 + 1;}//返回i右孩子下标int RightChild(int i){ return i * 2 + 2;}void Swap(int *a, int *b){ int nTmp = *a; *a = *b; *b = nTmp;}void MaxHeapify(int *pnArr, int nLen, int i){ int LChild = LeftChild(i); int RChild = RightChild(i); int nMaxPos; if (LChild < nLen && pnArr[LChild] > pnArr[i]) { nMaxPos = LChild; } else { nMaxPos = i; } if (RChild < nLen && pnArr[RChild] > pnArr[nMaxPos]) { nMaxPos = RChild; } if (nMaxPos != i) { Swap(&pnArr[nMaxPos], &pnArr[i]); MaxHeapify(pnArr, nLen,nMaxPos); }}void BuildMaxHeap(int *pnArr, int nLen){ for (int i = Parent(nLen -1); i >= 0; i--) { MaxHeapify(pnArr, nLen, i); }}void HeapSort(int *pnArr, int nLen){ BuildMaxHeap(pnArr, nLen); for (int i = nLen - 1; i > 0; i--) { Swap(&pnArr[i], &pnArr[0]); nLen--; MaxHeapify(pnArr, nLen, 0); }}int main(){ int nArr[10] = {4,1,3,2,16,9,10,14,8,7}; PrintArr(nArr, 10); HeapSort(nArr, 10); PrintArr(nArr, 10); system("pause"); return 0;}
代码下载及其运行
代码下载地址:http://download.csdn.net/detail/yincheng01/6704519
解压密码:c.itcast.cn
下载代码并解压后,用VC2013打开interview.sln,并设置对应的启动项目后,点击运行即可,具体步骤如下:
1)设置启动项目:右键点击解决方案,在弹出菜单中选择“设置启动项目”
2)在下拉框中选择相应项目,项目名和博客编号一致
3)点击“本地Windows调试器”运行
程序运行结果