数组中两个相邻元素的最小差值:(排序后的数组)
查找数组中的第几小元素:
将一个数组中小于pos值的元素放在pos的左边,将大于pos的值放在pos的右边(pos为非数组元素),求pos位置:
数组中两个相邻元素的最小差值:
#include<iostream>
#include<assert.h>
#include<math.h>
using namespace std;int Cppair(int arr[],int left,int right);
int partition(int arr[], int left, int right);
int Select(int arr[],int left,int right,int k);
int Max(int arr[],int left,int right);
int Min(int arr[],int left,int right);
int mins(int d1,int d2,int d3)'int Cpair(int arr[],int n)
{
assert(arr != NULL && n > 1);
return Cppair(arr,0,n-1);
}int Cppair(int arr[],int left,int right)
{
if(right - left <= 0)
return -1;int k = (right - left + 1)/2;
int pos = left + k - 1;
Select(arr,left,right,k);
int d1 = Cppair(arr,left,pos);
int d2 = Cppair(arr,pos+1,right);
int maxs1 = Max(arr,left,pos);
int mins2 = Min(arr,pos+1,right);
return mins(d1,d2,mins2 - maxs1);
}int Select(int arr[],int left,int right,int k) //排序返回第一个元素的值
{
if(left == right && k == 1) return arr[left];
int index = partition(arr,left,right); //排序后的基准值的下标
int pos = index - left +1; //基准值的下一个位置
if(k <= pos) return Select(arr,left,index,k);
else return Select(arr,index+1,right,k - pos);
}int partition(int arr[], int left, int right) //返回一趟排序后基准值的位置
{
int key = arr[left];
while (left < right)
{
while (left < right && arr[right] >= key)right--;
arr[left] = arr[right];
while (left < right && arr[left] <= key)left++;
arr[right] = arr[left];
}
arr[left] = key;
return left;
}int Max(int arr[],int left,int right) //数组中最大的元素
{
int max = arr[left];
for(int i = left + 1; i<=right;++i)
{
if(max < arr[i])
{
max = arr[i];
}
}return max;
}int Min(int arr[],int left,int right) //数组中最小的元素
{
int min = arr[left];
for(int i = left + 1; i<=right; ++i)
{
if(min > arr[i])
{
min = arr[i];
}
}return min;
}int mins(int d1,int d2,int d3) //三个数字中的最小值
{
return min(d1,min(d2,d3));
}int main()
{
int arr[]={56,12,34,78,90,67,45,100,84,18,12};
int n = sizeof(arr)/sizeof(arr[0]);
int mindiff = Cpair(arr,n);
cout<<mindiff<<endl;
}
查找数组中的第几小元素:
#include<iostream>
#include<assert.h>
#include<math.h>
using namespace std;int partition(int arr[], int left, int right);
int Select(int arr[],int left,int right,int k);int SelectK_Min(int arr[],int n,int k)
{
assert(arr != NULL && n > 1);
return Select(arr,0,n-1,k);
}int Select(int arr[],int left,int right,int k)
{
if(left == right && k == 1) return arr[left];
int index = partition(arr,left,right);
int pos = index - left +1;
if(k <= pos) return Select(arr,left,index,k);
else return Select(arr,index+1,right,k - pos);
}int partition(int arr[], int left, int right)
{
int key = arr[left];
while (left < right)
{
while (left < right && arr[right] >= key)right--;
arr[left] = arr[right];
while (left < right && arr[left] <= key)left++;
arr[right] = arr[left];
}
arr[left] = key;
return left;
}int main()
{
int arr[]={56,12,34,78,90,67,45,100,89,18};
int n = sizeof(arr)/sizeof(arr[0]);
for(int k = 1;k<=n;++k)
cout<<k<<" => "<<SelectK_Min(arr,n,k)<<endl;
return 0;
}
将一个数组中小于pos值的元素放在pos的左边,将大于pos的值放在pos的右边(pos为非数组元素),求pos位置:
#include<iostream>
#include<assert.h>
#include<math.h>
using namespace std;int partition(int arr[], int left, int right)
{
while (left < right)
{
while (left < right && arr[right] >= key)right--;
while (left < right && arr[left] <= key)left++;
}
if(left<right)
{
int key = arr[left];
arr[left] = arr[right];
arr[right] = tmp;
}
}int main()
{
int arr[]={56,12,34,78,90,67,45,100,89,18};
int a = Pos(arr,0,9,50);
cout <<a <<endl;
}