| 6 | #define mod 1000000007 |
| 7 | #define endl '\n' |
| 8 | int check(int arr[],int n,int key){ |
| 9 | int s,e; |
| 10 | s=0; |
| 11 | e=n-1; |
| 12 | int ans=0; |
| 13 | while(s>=e){ |
| 14 | int mid=s+(s+e)/2; |
| 15 | if(arr[mid]==key) |
| 16 | ans=1; |
| 17 | else if(key>arr[mid]) |
| 18 | s=mid+1; |
| 19 | else |
| 20 | e=mid-1; |
| 21 | } |
| 22 | return ans; |
| 23 | } |
| 24 | string isSubset(int arr1[],int arr2[],int n, int m){ |
| 25 | sort(arr1,arr1+n); |
| 26 | for (int i = 0; i < m; i++) { |
no outgoing calls
no test coverage detected