Question: in java language Question #5: (2.5 pts) 1) Write a method boolean divExists (int[] arr, int n, int x) that takes an array arr of

Question #5: (2.5 pts) 1) Write a method boolean divExists (int[] arr, int n, int x) that takes an array arr of integers of size "N and an integer number x and returns true if there exists two numbers whose sum is divisible by "X". 2) Compute the worst case complexity
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
