-
Notifications
You must be signed in to change notification settings - Fork 0
/
target sum 2.cpp
96 lines (82 loc) · 1.75 KB
/
target sum 2.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
//@author akshit ostwal
#include<stdio.h>
void swap(int* a, int* b)
{
int t = *a;
*a = *b;
*b = t;
}
int partition (int arr[], int low, int high)
{
int pivot = arr[high];
int i = (low - 1);
for (int j = low; j <= high- 1; j++)
{
if (arr[j] <= pivot)
{
i++;
swap(&arr[i], &arr[j]);
}
}
swap(&arr[i + 1], &arr[high]);
return (i + 1);
}
/* QuickSort
arr[] --> Array to be sorted,
low --> Starting index,
high --> Ending index */
void quickSort(int arr[], int low, int high)
{
if (low < high)
{
int pi = partition(arr, low, high);
quickSort(arr, low, pi - 1);
quickSort(arr, pi + 1, high);
}
}
void printArray(int arr[], int size)
{
int i;
for (i=0; i < size; i++)
printf("%d ", arr[i]);
printf("\n");
}
int binarySearch(int arr[], int l, int r, int x)
{
if (r >= l) {
int mid = l + (r - l) / 2;
if (arr[mid] == x)
return mid;
if (arr[mid] > x)
return binarySearch(arr, l, mid - 1, x);
return binarySearch(arr, mid + 1, r, x);
}
return -1;
}
int main()
{
int n,sum ;
printf("Enter number of elements you want to enter in array(no duplicate allowed)\n");
scanf("%d",&n);
int arr[n] ;
printf("enter your array\n");
for (int i = 0 ;i < n ; i += 1)
{
scanf("%d",&arr[i]);
}
printf("Enter the sum you want to get \n");
scanf("%d",&sum); //ex 2
quickSort(arr, 0, n-1);
printf("Sorted array: \n");
printArray(arr, n);
for(int i = 0 ; i < n ; i++)
{
int result = -1;
if((2 - arr[i] ) != 1)
result = binarySearch(arr , 0, n - 1, sum - arr[i]);
if (result != -1)
printf("[%d , %d]\t", arr[i], arr[result]);
}
return 0;
}
//@author akshit ostwal