Skip to content
Related Articles
Get the best out of our app
GFG App
Open App
geeksforgeeks
Browser
Continue

Related Articles

Javascript Program to Print uncommon elements from two sorted arrays

Improve Article
Save Article
Like Article
Improve Article
Save Article
Like Article

Given two sorted arrays of distinct elements, we need to print those elements from both arrays that are not common. The output should be printed in sorted order. 
Examples : 
 

Input : arr1[] = {10, 20, 30}
        arr2[] = {20, 25, 30, 40, 50}
Output : 10 25 40 50
We do not print 20 and 30 as these
elements are present in both arrays.

Input : arr1[] = {10, 20, 30}
        arr2[] = {40, 50}
Output : 10 20 30 40 50
        

 

The idea is based on merge process of merge sort. We traverse both arrays and skip common elements.
 

Javascript




<script>
// JavaScript program to find uncommon elements
// of two sorted arrays
 
    function printUncommon(arr1,
                     arr2, n1, n2)
    {
   
        let i = 0, j = 0, k = 0;
        while (i < n1 && j < n2) {
   
            // If not common, print smaller
            if (arr1[i] < arr2[j]) {
                document.write(arr1[i] + " ");
                i++;
                k++;
            }
            else if (arr2[j] < arr1[i]) {
                document.write(arr2[j] + " ");
                k++;
                j++;
            }
   
            // Skip common element
            else {
                i++;
                j++;
            }
        }
   
        // printing remaining elements
        while (i < n1)
        {
            document.write(arr1[i] + " ");
            i++;
            k++;
        }
        while (j < n2)
        {
            document.write(arr2[j] + " ");
            j++;
            k++;
        }
    }
 
// Driver Code
        let arr1 = [ 10, 20, 30 ];
        let arr2 = [ 20, 25, 30, 40, 50 ];
   
        let n1 = arr1.length;
        let n2 = arr2.length;
   
        printUncommon(arr1, arr2, n1, n2);
 
// This code is contributed by susmitakundugoaldanga.
</script>


Output : 

10 25 40 50

 

Time Complexity: O(n1 + n2), where n1 and n2 represents the size of the given two arrays.
Auxiliary Space: O(1), no extra space is required, so it is a constant.

Please refer complete article on Print uncommon elements from two sorted arrays for more details!
 


My Personal Notes arrow_drop_up
Last Updated : 13 Jun, 2022
Like Article
Save Article
Similar Reads
Related Tutorials