skype点数,星战士传说,安溪
#include <stdio.h> /* 二分查找条件: 1、有序序列 2、数据在数组中 */ int baseBinarySearch(int a[],int h,int k) { int low=0; int high=h; int mid =0; int NoFound = -1; while (low <= high) { mid = low + (high-low) /2 ; if ( k < a[mid] ) { high = mid - 1; } else if ( k > a[mid] ) { low = mid + 1; } else { return mid; } } return NoFound; } //查找第一个相等的元素 int FirstElementBinSearch(int a[],int h,int k) { int low=0; int high=h; int mid =0; int NoFound = -1; while (low <= high) { mid = low + (high-low) /2 ; if ( k <= a[mid] ) { high = mid - 1; } else { low = mid + 1; } } return low <= h ? low : NoFound; } //查找最后一个相等的元素low int LastElementBinSearch(int a[],int h,int k) { int low=0; int high=h; int mid =0; int NoFound = -1; while (low <= high) { mid = low + (high-low) /2 ; if ( k >= a[mid] ) { low = mid + 1 ; } else { high = mid -1 ; } } printf("%d %d %d\n",low,high,a[low-1]); if (low - 1 >= 0 && a[low - 1] ==k) { return low-1; } return NoFound; }
如对本文有疑问,请在下面进行留言讨论,广大热心网友会与你互动!! 点击进行留言回复
如何在没有core文件的情况下用dmesg+addr2line定位段错误
用QT制作3D点云显示器——QtDataVisualization
网友评论