7. If A(0..n-1] is an array with n elements and procedure Swap exchanges its arguments, then the following code sorts A in descending order. int j + 0 while (j < n - 1 ) int k + 0 while ( k < n - j - 1 ) if ( A[k] < A[k + 1] ) Swap ( A[k], A[k + 1] ) end if k + k + 1 end while j+j + 1 end while If A initially contains n different elements sorted in ascending order, how many calls to Swap are made in total?

9).An array of integers nums sorted in ascending order, find the startingand ending position of a given target value. If the target is not found in thearray, return [-1, -1]. For example:Input: nums = [5,7,7,8,8,8,10], target = 8Output: [3,5]Input: nums = [5,7,7,8,8,8,10], target = 11Output: [-1,-1]. Please weite your Code.

#Python Program a method merge_sort(a,b) that when given two sorted arrays a and b, returns a new sorted array c that has the elements from array a and array b. For example when givena = [1,3,5,6,10]b = [1,4,6,8] the resulting array should be: c = [1,1,3,4,5,6,6,8,10] The program should be implemented WITHOUT using any python libraries such as NumPy or other libraries. This method should not call a sorting method. Instead, the resulting array should be produced by "zipping" the two input arrays together: we repeatedly select the least element that we did not consider before from a and b and include this in c.merge_sort(a,b) :

1. Estimate in terms of n, the worst case time complexity of each of the following pseudo-code snippets: a. ALGORITHM sum(n) sum -0 for i 0 to n do for j +0 to n*n do sum Esum + 1 return sum

In main() for now: do these - one at a time, each in it's own loop (we will make functions out of them later –Declare an array RandArray with 20 integers –Assign each of the 20 values with a random value from 0 to 99 Hint: Use rand()%100 For mimir: Do not call srand at the top of main. // normally: Call srand(time(0)) at the top of main –(you need #include<cstdlib>) –Write another loop that prints the array, with index values Important: If the output values do not match mimir, please add srand(17); // inside your main function - at the top code format: #include <iostream>using namespace std; #include <cstdlib> // required for rand() int main(){   srand(17);   // define a constant ARRAYSIZE that is 20    // declare randArray    // set the 20 elements in randArray to be a random number between 0 and 99   // hint: use rand()%100   // print the 20 values return 0;}

6 - Merge sorted arrays Program a method merge_sorted(a,b) that when given two sorted arrays a and b, returns a new sorted array c that has the elements from array a and array b. For example when given = [1,3,5,6,10] a b = [1,4,6,8] %3D the resulting array should be: C = = [1,1,3,4,5,6,6,8,10] This method should not call a sorting method. Instead, the resulting array should be produced by "zipping" the two input arrays together: we repeatedly select the least element that we did not consider before from a and b and include this in c. For example: a = [1,3,5,6,10] b = [1,4,6,8] C = [1,1,3, ...] the arrows (^) point to the lowest element we did not consider before. Of these, element 4 from b is less than element 5 from a. For this reason, we select 4 as the next element and advance the arrow ^ for b to point to 6.

AIM: Write a program to do Binary Search using a given Search Key in a Sorted Linear Array 'A' which has N values in it. Description: The binary search algorithm can only be used with sorted array and eliminates one half of the elements in the array being searched after each comparison. The binary search algorithm applied to our array A works as follows: Algorithm: (Binary Search) Here A is a sorted Linear Array with N elements stored in it in sorted order and SKEY is a given item of information to search. This algorithm finds the location of SKEY in A and if successful, it returns its location otherwise it returns -1 for unsuccessful. BinarySearch (A, N, SKEY) [Initialize segment variables.] 1. Set START=0, END=N-1 and MID=int((START+END)/2). 2. Repeat Steps 3 and 4 while START ≤ END and A[MID]+SKEY. 3. If SKEY< A[MID] Then Set END=MID-1. Else Set START=MID+1. [End of If Structure.] 4. Set MID=int((START +END)/2). [End of Step 2 loop.] 5. If A[MID] = SKEY then Set LOC= MID Else Set…

Java program

Complete these functionsss function getEvenNumbers(nums) {/*This function takes an array of integers and returns an array containing only even integers*/ result = [];for(var i=0; i<nums.length; i++){if(nums[i] %2 == 0)result.push(nums[i]);} return result;} function flipBooleans(bools) {/*This function takes an array of booleans and should return an array of the opposite booleans.E.g. [true, true, false] => [false, false, true]*/} function translateKey(student, keyToChange, translation) {/*Northcoders is expanding to France ??. Unfortunately, our team on the ground in Paris doesn't speak the best English and has been providing us with student data partly in French. This function will take an object representing a student's data, a key that needs changing, and its English translation. E.g. const student = {prénom: 'Carla',surname: 'Bruni',job: 'Artist'}const keyToChange = 'prénom'const translation = 'firstName' It returns a **new object** with the key successfully translated into…

Write the function average which returns the mean of the given array (that is, the sum divided by the length). Use an iterator loop. arrays.cpp 1 #include // size t 2 double average(const double* beg, const double* end) { double sum{0}; int count{0}; 3 4 7 8 10 return sum / count; 11 }