Question

Design & Analysis of Algorithms

Implement the algorithm in Java of the following problem

Answer 1

#include<iostream>

using namespace std;

#define MaxInterval 3

struct Interval
{
int start, end;
};

void findSubset(Interval arr[MaxInterval], int a) {

Interval temp[MaxInterval];

int p = 0;
for (int i = 0; i < MaxInterval; i++) {
if (a >= arr[i].start && a <= arr[i].end) {
temp[p] = arr[i];
cout<<"interval is ("<<temp[p].start<<","<<temp[p].end<<")"<<endl; // will print the subset which contains point.
break;
}
}
}

int main() {
Interval arr[MaxInterval];

arr[0].start = 1;

arr[0].end = 5;

arr[1].start = 2;

arr[1].end = 3;

arr[2].start = 7;

arr[2].end = 12;

int numArr[5] = {1,3,4,8,10};

for (int i = 0; i < 5; i++) {

findSubset(arr, numArr[i]);

}

return 0;

}

Output:

interval is (1,5)
interval is (1,5)
interval is (1,5)
interval is (7,12)
interval is (7,12)

.