Complete the binary search function below using while loop. int search(int a[], int t, int l, int r) {}

Matrix Multiplication with OpenMPWrite a program that calculates the product of two matrices, using a parallel for loop. Note that this requires writing a triply-nested for loop, and making one of the for loops parallel.

#include <iostream> using namespace std; void insertElement(int* LA, int ITEM, int N, int K){ int J=N; //initialize j to n while(J>=K) //enters loop only if j less than or equal to k { LA[J+1]=LA[J]; //stores current value in next index J=J-1; //decrement j } LA[K]=ITEM; //insert element at index k N=N+1; //increment n by 1 //this is just used for printing and you can ignore if not required for(int i=0;i<N;i++) //i from 0 to n { cout << LA[i] << " "; //print element at index i }} int main(){ int LA[6]={1,2,3,4,5}; //declare an array and initialize values to it insertElement(LA,6,5,3); //call function to insert 6 at index 3 return 0;}note: Remove Funcation

Make new code please

DO NOT COPY FROM OTHER WEBSITES Correct and Detailed answer will be Upvoted else downvoted. Thank you!

#include <iostream>using namespace std; char* duplicateWithoutBlanks(char *word){int len = sizeof(word); char *new_str = new char[len + 1]; int k = 0; for (int i = 0; i < len; ++i){if (word[i] != ' ')new_str[k++] = word[i];} new_str[k] = '0円'; return new_str;} int main(){// Testing code char word[] = "Hello, World!"; char* result = duplicateWithoutBlanks(word); cout<< "word: "<< word<< "\nResult: "<< result; ; return 0;} What to change to out put the same word without blank?

do in c++

Binary Search of Strings1. Write a version of the selection sort algorithm presented in the unit, which is usedto search a list of strings.2. Write a version of the binary search algorithm presented in the unit, which isused to search a list of strings. (Use the selection sort that you designed aboveto sort the list of strings.)3. Create a test program that primes the list with a set of strings, sorts the list, andthen prompts the user to enter a search string. Your program should then searchthe list using your binary search algorithm to determine if the string is in the list.Allow the user to continue to search for strings until they choose to exit theprogram

Recamán's sequence def recaman(n): Compute and return the first n terms of the Recamán's sequence, starting from the term a1 = 1.Note how the definition for the current next element depends on whether a particular number is already part of the previously generated part of the sequence. To let your function execute in a speedy fashion even when generating a sequence that contains millions of elements, you should use a set to keep track of which values are already part of the previously generated sequence. This way you can generate each element in constant time, instead of having to iterate through the entire previously generated list. The better technique that saves time by using more memory can create this list arbitrarily far in linear time, and should therefore be fast even for millions of elements, at least until it runs out of memory. n Expected result 10 [1, 3, 6, 2, 7, 13, 20, 12, 21, 11] 1000000 (a list of million elements whose last five elements are [2057162,1057165,...

Fill in the blanks to initialize a character array, a_char) with content code a_char[] Then fill in the blanks in such a way that the following for loop simply prints code to standard output. for (int i = 0; i < i++) { std::cout << a char } std::cout 1# 11 U (a char)/sizeof( } Now fill in the blanks in such a way that the following range based for loop simply prints code to standard output. ; << # ; ); [a_char]){

3

Part 1 & 2) Lottery Winners Write a program that initializes an array with ten numbers (given below). Then let the player enter his or her lottery number. The program should ask the user if he/she wants to perform a linear search or binary search. (If the user chooses binary search, using one of the sorting algorithms we learned in the class, sort the array). Based on the searching algorithm payer chooses, it should print out the number of searching comparisons performed and if it was a winning number. int ticket[] = {85647, 62483, 13579, 26792, 52551, 33445, 79422, 76172, 93121, 26791 };\ Microsoft Visual Studio Debug Console Enter your 5-digit lottery number: 12345 Press 1 to perform linear search, 2 for binary search: 1 Original values: 85647 62483 13579 26792 52551 33445 79422 76172 93121 26791 Number of comparisons made: 10 You did not win. Microsoft Visual Studio Debug Console Enter your 5-digit lottery number: 12345 Press 1 to perform linear search, 2 for binary search: 2...

Java Task Write a for loop that prints the characters stored in a String object backward. The String is entered by the user. ***Use ch = phrase.charAt(i); to get the character that is in index i of the String phrase.**** For example The user enters "Good morning!" The printout should be "!gninrom dooG".