include stdafx include iostream include cstdlib include ctime using na

#include "stdafx.h"
#include <iostream>
#include <cstdlib>
#include <ctime> 
using namespace std;
 
int BinSearch(const int* arr, int count, int key);
 void s_vb(int a[], int n);
int main()
{	
	srand(time_t(NULL));
	setlocale(0,"");

		int n;
			cout << "Input elements of array: ";
				cin>>n;

		int *arr = new int[n];
		
		for(int i=0;i<n;i++)
			arr[i]=rand()%10;
		int key;
    
		cout << "key: ";
			cin >> key;
 
		for(int i=0;i<n;i++){
			cout << arr[i] << ' ';
		}cout <<'\n';

		if(BinSearch(arr, n, key) != -1)
			cout << "Yes" << endl;
		else cout << "No" << endl;
		
int k=BinSearch(arr,n,key);
int *b=new int [k];
for(int i=0;i<k;i++)
	b[i]=arr[i];

int *c=new int [n-k];
for(int i=0;i<(n-k);i++)
	c[i]=arr[k+i];

for(int i=0;i<k;i++)
	cout <<b[i]<<' ';
cout <<'\n';

s_vb(c,n-k);

for(int i=0;i<(n-k);i++)
	cout <<c[i]<<' ';
cout <<'\n';


int i=0;
for(;i<k;i++)
	arr[i]=b[i];
for(int t=0;i<n;i++,t++)
	arr[i]=c[t];
for(int t=0;t<n;t++)
	cout <<arr[t]<<' ';
cout <<'\n';
	delete [] arr;
    return 0;
}
 
int BinSearch(const int* arr, int count, int key) 
{
  int l = 0;            // bottom
  int u = count - 1;    // top
 
  while (l <= u) {
    int m = (l + u) / 2;
    if (arr[m] == key) return m;
    if (arr[m] < key) l = m + 1;
    if (arr[m] > key) u = m - 1;
  }
  return -1;
}


void s_vb(int a[], int n) { 
int imin,i,j,t; 
for(i=0; i<n-1; i++) { 
imin=i; 
for(j=i+1; j<n; j++) 
if (a[imin]>a[j]) 
imin=j; 
if (imin != i) { 
t = a[imin]; 
a[imin] = a[i]; 
a[i] = t; 
} 
} 
}