程序员面试题精选100题(42)-旋转数组的最小元素

// 程序员面试题精选100题(42)-旋转数组的最小元素.cpp : 定义控制台应用程序的入口点。
//

#include "stdafx.h"
#include <iostream>
using namespace std;

int minrotatenum(int *num,int n)// binary search supposed that the num has been rotated in order
{
	if(n==1) return num[0];
	if(n<=0||num==NULL) return -1;
	int low=0,high,mid;
	high = n-1;
	while(low<high)
	{
		mid = (low+high)/2;
		if (num[low]<num[mid]&&num[high]<num[mid])
		{
			low = mid;
		}
		else
		{
			if (num[low]>num[mid]&&num[high]>num[mid])
			{
				high = mid;
			}
			else
			{
				if (num[low]<num[high])
				{
					return num[low];
				}
				else
					return num[high];
			}
		}
	}
}
int Min(int *numbers, int length)//other's answer 
{
	if(numbers == 0 || length <= 0)
		throw new std::exception("Invalid parameters");

	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[indexMid] >= numbers[index1])
			index1 = indexMid;
		else if(numbers[indexMid] <= numbers[index2])
			index2 = indexMid;
	}

	return numbers[indexMid];
}

int _tmain(int argc, _TCHAR* argv[])
{
	int n;
	cin>>n;
	int *num=new int[n];
	cout<<"input n rotated number in order"<<endl;
	for (int i=0;i<n;i++)
	{
		cin>>num[i];
	}
	cout<<minrotatenum(num,n)<<endl;
	//cout<<Min(num,n)<<endl;
	system("pause");
	return 0;
}

感觉自己的算法比答案的要好呀，对不对，您帮测试一下