orderdvector.cpp

对8组包含不同个数据的向量进行排序

#include"Vector.h"
#include"orderdVector.h"
template <class T>void orderedVector<T>::deleteALLValues ()
{
	data.setSize(0);
}
template<class T>int orderedVector <T>::isEmpty ()const
{
	return data.length()==0;
}
template <class T>unsigned int orderedVector<T>::binarySearch (T)
{
	unsigned int low=0;
	unsigned int high=data.length();
	while(low<high)
	{
		unsigned int mid=(low+high)/2;
		if(data[mid]==value)return mid;
		else if (data[mid]<value)
			low=mid+1;
		else hig=mid;
	}
	return low;
}
template<class T>int orderedVector<T>::includes (T value)const
{
	unsigned int index=binarySearch(value);
	if((index<data.length())&&(value==data[index]))
	     return 1;
	return 0;
}
template <class T>void orderedVector<T>::add(T valude)
{
	unsigned int max +data.length();
	unsigned int index +binarySearch(value);
	data.setSize(max+1);
	for(unsigned int i=max;i>index;i--)
		data[i]=data[i-1];
	data[index]value;
}