算法
文章平均质量分 72
Mr_buffoon
远离舒适区
展开
-
UVA OJ部分题目代码
10055#include “stdio.h”int main(){long long n,m,t; while(scanf(“%lld%lld”,&n,&m)==2){ if(n>m) { t=n; n=m; m=t; } printf(“%lld\n”,m-n);} return 0;}10071#include “stdio.h”in原创 2015-10-07 09:12:49 · 560 阅读 · 0 评论 -
归并排序变种应用–求逆序数
The attached le Q5.txt contains 100,000 integers between 1 and 100,000(each row has a single integer), the order of these integers is random and no integer is repeated.1. Write a program to impl原创 2015-10-07 09:52:48 · 1017 阅读 · 0 评论 -
常用排序算法分析实现(C语言)
最近复习了一下内部排序的几种排序算法,并用c语言实现(都是以数组形式存储非负整数数据的,非链表)。此次实现的排序算法分别是冒泡排序,选择排序,插入排序,希尔排序,快速排序,堆排序,归并排序,基数排序。下面分别对这几种算法进行分析(均是由小到大排序):冒泡排序void maopao(int arr[]){int i,j,flag,temp;for(i=MAX-1;i>0;i–)原创 2015-10-07 10:25:27 · 820 阅读 · 0 评论 -
稳定的匹配算法–Gale-Shapley
Implement Gale-Shapley algorithm of the Stable Matching Problem in yourfavorite language, and give the matching result of attached ranking data(boys rankings.txt and girls rankings.txt), supposing t原创 2015-10-07 09:41:31 · 4542 阅读 · 2 评论 -
分治算法应用–求平面两点之间的最小距离
Implement the algorithm for the closest pair problem in your favourite lan-guage.INPUT: Given n points in a plane.OUTPUT: the pair with the least Euclidean distance.分析:题目给n个点,求距离最近的一对点之间原创 2015-10-07 09:55:45 · 8277 阅读 · 0 评论