fork(8) download
copy 
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3.  
  4.  
  5. int main(){
  6. 	int arr1[] = {1,3,4,5,7,11,123};
  7. 	int arr2[] = {2,3,5,6,7,8,9,11,23,123};
  8.  
  9. 	int i, j=0, k=0, l1, l2;
  10.  
  11. 	l1 = sizeof(arr1)/ sizeof(arr1[0]);
  12. 	l2 = sizeof(arr2)/ sizeof(arr2[0]);
  13.  
  14. 	while(j<l1 && k<l2){
  15. 		if(arr1[j]<arr2[k]){
  16. 			j++;
  17. 		}
  18. 		else if(arr1[j]>arr2[k]){
  19. 			k++;
  20. 		}
  21. 		else{
  22. 			printf("%d\t", arr1[j]);
  23. 			j++; k++;
  24. 		}
  25. 	}
  26.  
  27.  return 0;
  28. }
Success #stdin #stdout 0s 2008KB
comments ()
stdin
copy 
Standard input is empty
stdout
copy 
3	5	7	11	123
https://ideone.com/Fcd088
Intersection of 2 sorted arrays.
language:
C (gcc 8.3)
created:
9 years ago
visibility:
secret

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!