Write an implementation of “func(A)” that returns a peak in 2 dimensions -as defined by an entry greater than or equal to its 4 neighbor values.

Write a Java method using recursion that reorders an integer array in such a way that all the even values comes before the odd values Here is the code to start, fill in the missing part  output should be 8 6 2 4 4 4 4 3 5 5 3 7 1 9

Hello, i need help with understanding Big-O.   What is the execution time Big-O for each of the methods in the Queue-1.java interface for the  ArrayQueue-1.java  and   CircularArrayQueue-1.java implementations? Short Big-O reminders: Big-O is a measure of the worst case performance (in this case execution time). O(1) is constant time (simple assignment statements) O(n) is a loop that iterates over all of the elements. O(n2) is one loop nested in another loop, each of which iterates over all the elements. If a method calls another method, what happens in the called method must be taken into consideration. Queue.java public interface Queue<E> {    /**      * The element enters the queue at the rear.      */    public void enter(E element);     /**      * The front element leaves the queue and is returned.      * @throws java.util.NoSuchElementException if queue is empty.      */    public E leave();     /**      * Returns True if the queue is empty.      */    public boolean…

Write an algorithm called ArrayColumnSum(A[0..n-1, 0..n-1], B[0..n-1 ]) which takes asinput, one n x n matrix A and a list B of size n and outputs B such that B[k] as the sum of theelements of column k of A.

Now let's examine a Dynamic Program algorithm to solve this problem. 3.3 Let's say we have an array of length X+1. How would we define array[x]? or What is array[x] defined for?

Implement the remove(u) method, that removes the node u from a MeldableHeap. This method should run in O(log n) expected time. Use c++

Write a program that, given an array a[] of Ndouble values, finds a closest pair : two values whose difference is no greater than thethe difference of any other pair (in absolute value). The running time of your programshould be linearithmic in the worst case

The below integer array which is already sorted[ 1, 2, 3, 4, 4, 6, 6, 6 ]Write a complete routine in Python which removes the duplicates fromthe array in O( n) time with O(n) space complexity owing to a hashstructure. Your output should be [ 1, 2, 3, 4, 6] .

Write a programme that discovers the closest pair given an array a[] of N double values: two values whose difference is no bigger than the difference of any other pair (in absolute value). In the worst-case scenario, your program's execution time should be linearithmic.