int Min(int *numbers, int length) { if (numbers == NULL && length <= 0) throw std::exception("Invalid Inputs!"); int index1 = 0; int index2 = length - 1; int indexMid = index1; while (numbers[index1] >= numbers[index2]) { if (index2 - index1 == 1) { indexMid = index2; break; } indexMid = (index1 + index2) / 2; if (numbers[index1] == numbers[index2] && numbers[indexMid] == numbers[index1]) return MinInOrder(numbers, index1, index2); if (numbers[indexMid] >= numbers[index1]) index1 = indexMid; else if (numbers[indexMid] <= numbers[index2]) index2 = indexMid; } return numbers[indexMid]; }
int Min(int* numbers, int length) { if(numbers == nullptr || length <= 0) throw new std::exception("Invalid parameters"); int index1 = 0; int index2 = length - 1; int indexMid = index1; while(numbers[index1] >= numbers[index2]) { // 如果index1和index2指向相邻的两个数, // 则index1指向第一个递增子数组的最后一个数字, // index2指向第二个子数组的第一个数字,也就是数组中的最小数字 if(index2 - index1 == 1) { indexMid = index2; break; } // 如果下标为index1、index2和indexMid指向的三个数字相等, // 则只能顺序查找 indexMid = (index1 + index2) / 2; if(numbers[index1] == numbers[index2] && numbers[indexMid] == numbers[index1]) return MinInOrder(numbers, index1, index2); // 缩小查找范围 if(numbers[indexMid] >= numbers[index1]) index1 = indexMid; else if(numbers[indexMid] <= numbers[index2]) index2 = indexMid; } return numbers[indexMid]; }
int Min(int *numbers, int length, int *min_num) { int index1, index2, indexMid; if (numbers == NULL || length <= 0) return -1; index1 = 0; index2 = length - 1; indexMid = index1; while (numbers[index1] >= numbers[index2]) { if (index2 - index1 == 1) { indexMid = index2; break; } indexMid = (index1 + index2) / 2; if (numbers[index1] == numbers[indexMid] && numbers[index2] == numbers[indexMid]) { *min_num = MinInOrder(numbers, index1, index2); return 0; } if (numbers[indexMid] >= numbers[index1]) index1 = indexMid; else if (numbers[indexMid] <= numbers[index2]) index2 = indexMid; } *min_num = numbers[indexMid]; return 0; }
int Min(int * numbers,int length){ if(numbers == NULL || length <= 0) return 0; int index1 = 0; int index2 = length - 1; int indexMid = index1; while(numbers[index1] >= numbers[index2]){ //如果index1与index2相邻, //那么index1指向第一个递增数组的最后一个数字, //index2指向第二个递增数组的第一个数字 ,也就是最小的数字 if(index2 - index1 == 1){ indexMid = index2; break; } //如果下标为index1、index2和indexMid指向的三个数字相等 //只能顺序查找 indexMid = (index1 + index2) / 2; //如果下标为index1、index2和indexMid指向的三个数字相等 //按照顺序查找 if(numbers[index1] == numbers[index2] && numbers[indexMid] == numbers[index1]){ return MinInOrder(numbers,index1,index2); } //二分法,缩小查找范围 if(numbers[indexMid] >= numbers[index1]){ index1 = indexMid; } else if(numbers[indexMid] <= numbers[index2]){ index2 = indexMid; } } return numbers[indexMid]; }