ɪɴ ᴊᴀᴠᴀ ᴡʜᴀᴛ ɪꜱ ɴᴇᴇᴅᴇᴅ ɪꜱ ᴀ ᴘʀᴏɢʀᴀᴍ ᴡʜɪᴄʜ ᴛᴀᴋᴇꜱ ᴀꜱ ɪɴᴘᴜᴛ ᴛᴡᴏ ꜱᴏʀᴛᴇᴅ ᴀʀʀᴀУꜱ ᴀɴᴅ ʀᴇᴛᴜʀɴꜱ ᴀ ɴᴇᴡ ᴀʀʀᴀУ ᴄᴏɴᴛᴀɪɴɪɴɢ ᴛʜᴇ ᴇʟᴇᴍᴇɴᴛꜱ ꜰᴏᴜɴᴅ ɪɴ ʙᴏᴛʜ ᴛʜᴇ ꜱᴏʀᴛᴇᴅ ᴀʀʀᴀУꜱ. ɪᴛ ɪꜱ ᴀʟʀɪɢʜᴛ ɪꜰ ᴛʜᴇ ɪɴᴘᴜᴛ ᴀʀʀᴀУꜱ ʜᴀᴠᴇ ᴅᴜᴘʟɪᴄᴀᴛᴇꜱ ʙᴜᴛ ᴛʜᴇ ʀᴇᴛᴜʀɴᴇᴅ ᴀʀʀᴀУ ꜱʜᴏᴜʟᴅ ʙᴇ ᴅᴜᴘʟɪᴄᴀᴛᴇ ꜰʀᴇᴇ ! ʙᴇʟᴏᴡ ɪꜱ ʜᴏᴡ ᴛʜᴇ ᴀʀʀᴀУꜱ ᴀʀᴇ ʀᴇᴘʀᴇꜱᴇɴᴛᴇᴅ ᴀʀʀᴀУ1[] = [1, 5, 6, 6, 9, 9, 9, 11, 11, 21] ʜᴇʀᴇ ʟᴇɴɢᴛʜ ᴏꜰ ᴀʀʀᴀУ1 ɪꜱ ᴍ.   ᴀʀʀᴀУ2[] = [6, 6, 9, 11, 21, 21, 21] ʜᴇʀᴇ ʟᴇɴɢᴛʜ ᴏꜰ ᴀʀʀᴀУ2 ɪꜱ ɴ.   ᴀʀʀᴀУ ᴛᴏ ʙᴇ ʀᴇᴛᴜʀɴᴇᴅ ᴡᴏᴜʟᴅ ʙᴇ: ᴀʀʀᴀУ[] = [6, 9, 11, 21] ( ᴅᴏ ɴᴏᴛ ᴜꜱᴇ ʟɪʙʀᴀʀУ ꜰᴜɴᴄᴛɪᴏɴꜱ ᴛᴏ ᴅᴏ ᴀɴУ ᴏꜰ ᴛʜᴇ ᴛᴀꜱᴋꜱ ʀᴇQᴜɪʀᴇᴅ ᴀʙᴏᴠᴇ)  ᴡʜᴀᴛ ɪꜱ ᴛᴏ ʙᴇ ɪᴍᴘʟᴇᴍᴇɴᴛᴇᴅ ɪꜱ ᴀ ꜰᴜɴᴄᴛɪᴏɴ ɪɴ ꜱᴜᴄʜ ᴀ ᴡᴀУ ᴛʜᴀᴛ ᴛʜᴇ ꜱᴏʟᴜᴛɪᴏɴ ꜱᴏʟᴠᴇꜱ ᴛʜᴇ ᴘʀᴏʙʟᴇᴍ ᴡɪᴛʜ ᴏ(ᴍɴ) ᴛɪᴍᴇ ᴄᴏᴍᴘʟᴇxɪᴛУ. ᴏ(ᴍɴ) ɪꜱ ꜱᴀᴍᴇ ᴀꜱ ᴏ(ᴍ ∗ ɴ).   Тʜɪꜱ ʙʀᴜᴛᴇ-ꜰᴏʀᴄᴇ ᴍᴇᴛʜᴏᴅ ꜱᴜɢɢᴇꜱᴛᴇᴅ ʜᴀꜱ ᴀ ɴᴀᴍᴇ ᴄᴀʟʟᴇᴅ ”ʟᴏᴏᴘ-ᴊᴏɪɴ” ᴡʜᴇʀᴇ Уᴏᴜ ʙᴀꜱɪᴄᴀʟʟУ ᴊᴜꜱᴛ ᴛʀᴀᴠᴇʀꜱᴇ ᴛʜʀᴏᴜɢʜ ᴛʜᴇ ᴇʟᴇᴍᴇɴᴛꜱ ᴏꜰ ᴏɴᴇ ᴀʀʀᴀУ ᴄᴏᴍᴘᴀʀɪɴɢ ɪᴛ ᴛᴏ ᴛʜᴇ ᴇʟᴇᴍᴇɴᴛꜱ ᴏꜰ ᴛʜᴇ ᴏᴛʜᴇʀ ᴀʀʀᴀУ ᴀꜱ ᴀ ᴄᴏᴍᴍᴇɴᴛ ɪɴ ᴛʜᴇ ᴄᴏᴅᴇ, ᴘʟᴇᴀꜱᴇ ᴡʀɪᴛᴇ ᴛʜᴇ ᴛᴇꜱᴛ-ᴄᴀꜱᴇꜱ ᴏɴ ʜᴏᴡ ᴏɴᴇ ᴡᴏᴜʟᴅ ᴛᴇꜱᴛ ᴛʜᴇ ꜱᴏʟᴜᴛɪᴏɴ ᴀꜱꜱᴜᴍᴘᴛɪᴏɴꜱ ᴀɴᴅ ʜᴇɴᴄᴇ ᴛʜᴇ ᴄᴏᴅᴇ.    ᴇxᴀᴍᴘʟᴇ ᴏꜰ ᴄᴀꜱᴇꜱ ᴛᴏ ʙᴇ ᴛᴇꜱᴛᴇᴅ ꜰᴏʀ ᴀʀᴇ ʟɪᴋᴇ : ᴡʜᴀᴛ ɪꜰ ᴛʜᴇ ᴀʀʀᴀУ ɪɴᴘᴜᴛ ᴡʜɪᴄʜ ɪꜱ ᴇxᴘᴇᴄᴛᴇᴅ ᴅᴏᴇꜱ ɴᴏᴛ ᴇxɪꜱᴛ - ᴛʜᴀᴛ ɪꜱ , ɪɴᴘᴜᴛ ɪꜱ ᴀ ɴᴜʟʟ. ʜᴏᴡ ꜱʜᴏᴜʟᴅ Уᴏᴜʀ ᴄᴏᴅᴇ ʜᴀɴᴅʟᴇ ꜱᴜᴄʜ ᴀ ꜱɪᴛᴜᴀᴛɪᴏɴ ? ᴍᴀУʙᴇ ᴏᴜᴛᴘᴜᴛ ꜱᴏᴍᴇ ᴍᴇꜱꜱᴀɢᴇ ʟɪᴋᴇ ”ɴᴜʟʟ ɪɴᴘᴜᴛ ᴄᴀꜱᴇ, ꜱᴏ ɴᴏ ᴏᴜᴛᴘᴜᴛ”? ᴡʜᴀᴛ ɪꜰ ᴛʜᴇ ʟᴇɴɢᴛʜ ᴏꜰ ᴛʜᴇ ᴀʀʀᴀУ ɪꜱ ᴏɴᴇ ?....ꜱᴏ ᴏɴ ᴀɴᴅ ꜱᴏ ꜰᴏʀᴛʜ

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

ɪɴ ᴊᴀᴠᴀ ᴡʜᴀᴛ ɪꜱ ɴᴇᴇᴅᴇᴅ ɪꜱ ᴀ ᴘʀᴏɢʀᴀᴍ ᴡʜɪᴄʜ ᴛᴀᴋᴇꜱ ᴀꜱ ɪɴᴘᴜᴛ
ᴛᴡᴏ ꜱᴏʀᴛᴇᴅ ᴀʀʀᴀУꜱ ᴀɴᴅ ʀᴇᴛᴜʀɴꜱ ᴀ ɴᴇᴡ ᴀʀʀᴀУ ᴄᴏɴᴛᴀɪɴɪɴɢ ᴛʜᴇ ᴇʟᴇᴍᴇɴᴛꜱ ꜰᴏᴜɴᴅ ɪɴ
ʙᴏᴛʜ ᴛʜᴇ ꜱᴏʀᴛᴇᴅ ᴀʀʀᴀУꜱ. ɪᴛ ɪꜱ ᴀʟʀɪɢʜᴛ ɪꜰ ᴛʜᴇ ɪɴᴘᴜᴛ ᴀʀʀᴀУꜱ ʜᴀᴠᴇ ᴅᴜᴘʟɪᴄᴀᴛᴇꜱ ʙᴜᴛ ᴛʜᴇ
ʀᴇᴛᴜʀɴᴇᴅ ᴀʀʀᴀУ ꜱʜᴏᴜʟᴅ ʙᴇ ᴅᴜᴘʟɪᴄᴀᴛᴇ ꜰʀᴇᴇ !

ʙᴇʟᴏᴡ ɪꜱ ʜᴏᴡ ᴛʜᴇ ᴀʀʀᴀУꜱ ᴀʀᴇ ʀᴇᴘʀᴇꜱᴇɴᴛᴇᴅ
ᴀʀʀᴀУ1[] = [1, 5, 6, 6, 9, 9, 9, 11, 11, 21]
ʜᴇʀᴇ ʟᴇɴɢᴛʜ ᴏꜰ ᴀʀʀᴀУ1 ɪꜱ ᴍ.
  ᴀʀʀᴀУ2[] = [6, 6, 9, 11, 21, 21, 21]
ʜᴇʀᴇ ʟᴇɴɢᴛʜ ᴏꜰ ᴀʀʀᴀУ2 ɪꜱ ɴ.
  ᴀʀʀᴀУ ᴛᴏ ʙᴇ ʀᴇᴛᴜʀɴᴇᴅ ᴡᴏᴜʟᴅ ʙᴇ:
ᴀʀʀᴀУ[] = [6, 9, 11, 21]

( ᴅᴏ ɴᴏᴛ ᴜꜱᴇ ʟɪʙʀᴀʀУ ꜰᴜɴᴄᴛɪᴏɴꜱ ᴛᴏ ᴅᴏ ᴀɴУ ᴏꜰ
ᴛʜᴇ ᴛᴀꜱᴋꜱ ʀᴇQᴜɪʀᴇᴅ ᴀʙᴏᴠᴇ) 


ᴡʜᴀᴛ ɪꜱ ᴛᴏ ʙᴇ ɪᴍᴘʟᴇᴍᴇɴᴛᴇᴅ ɪꜱ ᴀ ꜰᴜɴᴄᴛɪᴏɴ ɪɴ ꜱᴜᴄʜ ᴀ ᴡᴀУ ᴛʜᴀᴛ ᴛʜᴇ ꜱᴏʟᴜᴛɪᴏɴ ꜱᴏʟᴠᴇꜱ
ᴛʜᴇ ᴘʀᴏʙʟᴇᴍ ᴡɪᴛʜ ᴏ(ᴍɴ) ᴛɪᴍᴇ ᴄᴏᴍᴘʟᴇxɪᴛУ. ᴏ(ᴍɴ) ɪꜱ ꜱᴀᴍᴇ ᴀꜱ ᴏ(ᴍ ∗ ɴ).
  Тʜɪꜱ ʙʀᴜᴛᴇ-ꜰᴏʀᴄᴇ ᴍᴇᴛʜᴏᴅ ꜱᴜɢɢᴇꜱᴛᴇᴅ ʜᴀꜱ ᴀ ɴᴀᴍᴇ ᴄᴀʟʟᴇᴅ ”ʟᴏᴏᴘ-ᴊᴏɪɴ” ᴡʜᴇʀᴇ
Уᴏᴜ ʙᴀꜱɪᴄᴀʟʟУ ᴊᴜꜱᴛ ᴛʀᴀᴠᴇʀꜱᴇ ᴛʜʀᴏᴜɢʜ ᴛʜᴇ ᴇʟᴇᴍᴇɴᴛꜱ ᴏꜰ ᴏɴᴇ ᴀʀʀᴀУ ᴄᴏᴍᴘᴀʀɪɴɢ
ɪᴛ ᴛᴏ ᴛʜᴇ ᴇʟᴇᴍᴇɴᴛꜱ ᴏꜰ ᴛʜᴇ ᴏᴛʜᴇʀ ᴀʀʀᴀУ


ᴀꜱ ᴀ ᴄᴏᴍᴍᴇɴᴛ ɪɴ ᴛʜᴇ ᴄᴏᴅᴇ, ᴘʟᴇᴀꜱᴇ ᴡʀɪᴛᴇ ᴛʜᴇ ᴛᴇꜱᴛ-ᴄᴀꜱᴇꜱ ᴏɴ ʜᴏᴡ ᴏɴᴇ ᴡᴏᴜʟᴅ
ᴛᴇꜱᴛ ᴛʜᴇ ꜱᴏʟᴜᴛɪᴏɴ ᴀꜱꜱᴜᴍᴘᴛɪᴏɴꜱ ᴀɴᴅ ʜᴇɴᴄᴇ ᴛʜᴇ ᴄᴏᴅᴇ.
  
ᴇxᴀᴍᴘʟᴇ ᴏꜰ ᴄᴀꜱᴇꜱ ᴛᴏ ʙᴇ ᴛᴇꜱᴛᴇᴅ ꜰᴏʀ ᴀʀᴇ ʟɪᴋᴇ : ᴡʜᴀᴛ ɪꜰ ᴛʜᴇ ᴀʀʀᴀУ ɪɴᴘᴜᴛ ᴡʜɪᴄʜ
ɪꜱ ᴇxᴘᴇᴄᴛᴇᴅ ᴅᴏᴇꜱ ɴᴏᴛ ᴇxɪꜱᴛ - ᴛʜᴀᴛ ɪꜱ , ɪɴᴘᴜᴛ ɪꜱ ᴀ ɴᴜʟʟ. ʜᴏᴡ ꜱʜᴏᴜʟᴅ Уᴏᴜʀ ᴄᴏᴅᴇ
ʜᴀɴᴅʟᴇ ꜱᴜᴄʜ ᴀ ꜱɪᴛᴜᴀᴛɪᴏɴ ? ᴍᴀУʙᴇ ᴏᴜᴛᴘᴜᴛ ꜱᴏᴍᴇ ᴍᴇꜱꜱᴀɢᴇ ʟɪᴋᴇ ”ɴᴜʟʟ ɪɴᴘᴜᴛ
ᴄᴀꜱᴇ, ꜱᴏ ɴᴏ ᴏᴜᴛᴘᴜᴛ”? ᴡʜᴀᴛ ɪꜰ ᴛʜᴇ ʟᴇɴɢᴛʜ ᴏꜰ ᴛʜᴇ ᴀʀʀᴀУ ɪꜱ ᴏɴᴇ ?....ꜱᴏ ᴏɴ ᴀɴᴅ
ꜱᴏ ꜰᴏʀᴛʜ

Expert Solution
Step 1

The Java program for the given problem is as follows:

import java.util.Arrays;
public class Main {
    public static void main(String[] args) {
        // Test case 1: Two arrays with common elements
        int[] arr1 = {1, 5, 6, 6, 9, 9, 9, 11, 11, 21};
        int[] arr2 = {6, 6, 9, 11, 21, 21, 21};
        int[] result = mergeArrays(arr1, arr2);
        System.out.println(Arrays.toString(result));
        // Test case 2: Two arrays with no common elements
        int[] arr3 = {1, 3, 5};
        int[] arr4 = {2, 4, 6};
        int[] result2 = mergeArrays(arr3, arr4);
        System.out.println(Arrays.toString(result2));
        // Test case 3: One array is null
        int[] arr5 = null;
        int[] arr6 = {1, 3, 5};
        int[] result3 = mergeArrays(arr5, arr6);
        System.out.println(Arrays.toString(result3));
        // Test case 4: Length of array is one
        int[] arr7 = {1};
        int[] arr8 = {1};
        int[] result4 = mergeArrays(arr7, arr8);
        System.out.println(Arrays.toString(result4));
    }
    public static int[] mergeArrays(int[] arr1, int[] arr2) {
        if (arr1 == null || arr2 == null) {
            System.out.println("null input case, so no output");
            return null;
        }
        int m = arr1.length;
        int n = arr2.length;
        int[] result = new int[Math.min(m, n)];
        int k = 0;
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                if (arr1[i] == arr2[j]) {
                    boolean isDuplicate = false;
                    for (int p = 0; p < k; p++) {
                        if (result[p] == arr1[i]) {
                            isDuplicate = true;
                            break;
                        }
                    }
                    if (!isDuplicate) {
                        result[k] = arr1[i];
                        k++;
                    }
                }
            }
        }
        return Arrays.copyOfRange(result, 0, k);
    }
}

steps

Step by step

Solved in 2 steps with 3 images

Blurred answer
Knowledge Booster
Binary numbers
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education