Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdbool.h>
- #include <stdio.h>
- #include <stdlib.h>
- #include <time.h>
- bool exists_in(int V[], size_t v_length, int to_find) {
- for (size_t i = 0; i < v_length; i++) {
- if (V[i] == to_find) {
- return true;
- }
- }
- return false;
- }
- #define N 10
- int main(void) {
- srand(time(NULL));
- int A[N] = {0}, B[N] = {0}, intersection[N + N] = {0};
- for (size_t i = 0; i < N; i++) {
- A[i] = rand() % 30 + 1;
- B[i] = rand() % 30 + 1;
- }
- // Printing generated array A
- printf("A: [");
- for (size_t i = 0; i < N; i++) {
- printf("%d ", A[i]);
- }
- printf("]\n");
- // Printing generated array B
- printf("B: [ ");
- for (size_t i = 0; i < N; i++) {
- printf("%d ", B[i]);
- }
- printf("]\n");
- // A intesection B
- int intersections_i = 0;
- for (size_t i = 0; i < N; i++) {
- if (exists_in(B, N, A[i]) &&
- !exists_in(intersection, intersections_i, A[i])) {
- intersection[intersections_i++] = A[i];
- }
- }
- // Printing insersection
- printf("Intersection: [ ");
- for (size_t i = 0; i < intersections_i; i++) {
- printf("%d ", intersection[i]);
- }
- printf("]\n");
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement