![](https://img-blog.csdnimg.cn/20201014180756927.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
数据结构与算法
yao_hust_iAC
这个作者很懒,什么都没留下…
展开
-
九度OJ1004 Median
题目描述: Given an increasing sequence S of N integers, the median is the number at the middle position. For example, the median of S1={11, 12, 13, 14} is 12, and the median of S2={9, 10, 15, 16, 17原创 2014-09-18 22:48:03 · 1682 阅读 · 0 评论 -
ZOJ1002 FIRE NET
ZOJ 1002原创 2014-09-12 11:02:43 · 762 阅读 · 0 评论 -
8种经典排序算法总结
1.二分查找 代码: int binarySearch(int arr[],int l,int r,int x) { while(l { int m = l + (r-1)/2;//为了防止(l+r溢出) if(arr[m] == x) return m; if(arr[m]原创 2015-01-19 09:40:03 · 790 阅读 · 1 评论