Write a java code to implement binary search on a sorted array of size 15. Use random values(integers

Write a complete Java program to implement Quick and Merge sorting algorithms. Input an array of double data type, and choice of sorting algorithm to be used, from the user. Display the sorted array to the user. Run the program and display output samples [2 Marks] (Hint Refer to Lab 9)

Affine cipher is an example of? 1. Mono alphabetic cipher 2. Poly alphabetic cipher 3. Transposition cipher 4. Asymmetric cipher

write a java program that implements the selection sort algorithum that sorts list of doubles in the range of [0,500). use array objects that use to contain the list

Write the Java method scrambleArray, a void method that returns with the values of given double array scrambled (i.e., randomized).

Write a JAVA Program to get thek largest elements in an user entered array.

Let a[] be a sorted array of n integers. Search a given key, say k, on using the binary search method. Use Java method