Professional Documents
Culture Documents
<bits/stdc++.h>
using namespace std;
int printUnion(int a1[], int a2[], int m, int n)
{
int i = 0;
int j = 0;
while (i < m && j < n)
{
if (a1[i] < a2[j])
cout << a1[i++] << " ";
else if (a1[i] > a2[j])
cout << a2[j++] << " ";
else
{
cout << a2[j++] << " ";
i++;
}
}
while (i < m)
cout << a1[i++] << " ";
while (j < n)
cout << a2[j++] << " ";
}
int printIntersection(int a1[], int a2[], int m, int n)
{
int i = 0;
int j = 0;
while (i < m && j < n)
{
if (a1[i] < a2[j])
i++;
else if (a1[i] > a2[j])
j++;
else
{
cout << a2[j++] << " ";
i++;
}
}
}
int main()
{
int a1[] = {1, 2, 4, 5, 6};
int a2[] = {2, 3, 5, 7};
int m = sizeof(a1) / sizeof(a1[0]);
int n = sizeof(a2) / sizeof(a2[0]);
printUnion(a1, a2, m, n);
cout << "\n";
printIntersection(a1, a2, m, n);
return 0;
}
Reverse an Array
/*C++ program to reverse an array
time complexity: O(n)*/
#include <bits/stdc++.h>
using namespace std;
void reverseArray(int arr[], int start, int end)
{
while (start < end)
{
int temp = arr[start];
arr[start] = arr[end];
arr[end] = temp;
start++;
end--;
}
}
//function to print an array
void printArray(int arr[], int size)
{
for (int i = 0; i < size; i++)
{
cout << arr[i] << endl;
cout << endl;
}
}
//driver function
int main()
{
int arr[] = {1, 2, 3, 4, 5, 6};
int n = sizeof(arr) / sizeof(arr[0]);
//print original array
printArray(arr, n);
//function calling
reverseArray(arr, 0, n - 1);
cout << "Reversed array is" << endl;
//print the reversed array
printArray(arr, n);
return 0;
}
/*Next Palimbrome*/
#include <bits/stdc++.h>
using namespace std;
void reverse(int arr[], int start, int end)
{
int i = start, j = end;
while (i < j)
{ [i++], a
swap(arr rr[j--]);
}
}
void swap(int &a, int &b)
{
int temp = a;
a = b;
b = temp;
}
void nextPermutation(int arr[], int n)
{
int index1 = -1, index2;
for (int i = n - 2; i >= 0; i--)
{
if (arr[i] < arr[i + 1])
{
index1 = i;
break;
}
}
if (index1 == -1)
{
reverse(arr, 0, n - 1);
return;
}
for (int i = n - 1; i > index1; i--)
{
if (arr[i] > arr[index1])
{
index2 = i;
break;
}
}
swap(arr[index1], arr[index2]);
reverse(arr, index1 + 1, n - 1);
}
int main()
{
int n;
cin >> n;
int *arr = new int[n];
for (int i = 0; i < n; i++)
{
cin >> arr[i];
}
nextPermutation(arr, n);
for (int i = 0; i < n; i++)
{
cout << arr[i] << " ";
}
delete[] arr;
return 0;
}
#include<bits/stdc++.h>
using namespace std;
void swap(int *a,int *b)
{
int t=*a;
*a=*b;
*b=t;
}
int partition(int arr[],int low,int high)
{
int pivot,i;
pivot=arr[high];
i=low-1;
for(int j=low;j<high;j++)
{
if(arr[j]<pivot)
{
i++;
swap(&arr[i],&arr[j]);
}
}
swap(&arr[i+1],&arr[high]);
return(i+1);
}
int quicksort(int arr[],int low,int high)
{
if(low<high)
{
int pi;
pi=partition(arr,low,high);
quicksort(arr,low,pi-1);
quicksort(arr,pi+1,high);
}
}
int main()
{
int limit,k;
cin>>limit;
int arr[limit];
for(int i=0;i<limit;i++)
cin>>arr[i];
cin>>k;
quicksort(arr,0,limit-1);
cout<<arr[k-1];
return 0;
}