#include using namespace std;/*快速排序通过一趟排序,以轴点为界 分割为两部分:左部分 =length) //break; int i,key,j; if (low=key) //从高到低,直到找到第一个=length) //bre...
分类:
其他好文 时间:
2014-09-11 01:04:21
阅读次数:
228
The module pattern is a common JavaScript coding pattern. It’s generally well understood, but there are a number of advanced uses that have not gotten...
分类:
编程语言 时间:
2014-09-10 00:25:39
阅读次数:
370
1 public class Solution { 2 public boolean search(int[] A, int target) { 3 int low=0, high=A.length-1; 4 while (low=target) low=m...
分类:
其他好文 时间:
2014-09-09 23:02:39
阅读次数:
217
A computer system is described having one or more host processors, a host chipset and an input/output (I/O) subsystem. The host processors are connect...
分类:
其他好文 时间:
2014-09-09 22:53:09
阅读次数:
370
1 public class Solution { 2 public int search(int[] A, int target) { 3 int low=0, high=A.length-1; 4 5 while (lowA[mid] ...
分类:
其他好文 时间:
2014-09-09 21:30:09
阅读次数:
178
1.二分查找算法function two_find($arr,$low,$height,$k){ if($low<=$height){ $mid = intval(($low+$height)/2); if($arr[$mid]==$k){ r...
分类:
Web程序 时间:
2014-09-09 15:54:28
阅读次数:
197
public class QuickSort { public static void sort(int arr[],int low,int high){ int l=low; int h=high; int temp=arr[low]; ...
分类:
其他好文 时间:
2014-09-09 11:15:48
阅读次数:
241
import java.util.Scanner;public class Main { private static int count=0; public static void mergesort(int a[],int low,int high) { if(l...
分类:
编程语言 时间:
2014-09-09 10:39:58
阅读次数:
241
public class Solution { public boolean searchMatrix(int[][] matrix, int target) { int low=0, high=matrix.length-1; while (low target)...
分类:
其他好文 时间:
2014-09-08 00:58:06
阅读次数:
347
public class Solution { public int maxArea(int[] height) { int len = height.length, low = 0, high = len - 1; int area = 0; whi...
分类:
其他好文 时间:
2014-09-07 23:40:15
阅读次数:
233