Can you write the running time functions (f(n)) in terms of n for the following function and its classification in ters of big-O asymptotic notation. Consider an operation to be variable assigment, data comparision,s arithmetic operations, and conditional statementsbool divisible_12_1(const std::vector<int>& vector){    if (vector.size() < 2) return false;    bool d_4 = false;    bool d_2 = false;    bool d_3 = false;    for (int n : vector) {        if (n % 4 == 0) d_4 = true;        else if (n % 2 == 0) d_2 = true;        if (n % 3 == 0) d_3 = true;        if ((d_2 && d_3) || (d_4 && d_3)) return true;    }    return false;}

Code in C. Solve the code below.    Write a function that takes a vector of integers, an integer n representing the number of elements in that vector, and an integer b. Implement the sequential search algorithm to look for the integer b in the vector. The sequential search works as follows: you must look at all the elements of the vector until you find the b, from the first to the last. The function must return an integer representing how many elements the function tested until it found b. If it does not find the function, it must return 0. The name of the function must be called "busca_seq".   int busca_seq(int vetor[], int n, int b) {    //your code }   My Code   #include<stdio.h> int busca_seq(int vetor[], int n, int b) {  int i;  for(i = 0; i < n; i++){   if(vetor[i] == b)    return (i+1);  }    {  int vet[5],n = 5,b,x;    vet[0] = 1;  vet[1] = 2;  vet[2] = 3;  vet[3] = 4;  vet[4] = 5;    scanf("%d",&b);  x = busca_seq(vet,n,b);  printf("%d",x);      return 0;  }  }

The---is a nature of z in this .;command >>surf(x, y, z) Matrix O Vector Scaler Integer String this cod The result of executing .---->>7*((6&1) + (~0.00) +(0&5)); is error cod 49 14 O 48 7

Data Structures and Algorithms in C/C++ a) Implement the addLargeNumbers function with the following prototype: void addLargeNumbers(const char *pNum1, const char *pNum2); This function should output the result of adding the two numbers passed in as strings. Here is an example call to this function with the expected output: /* Sample call to addLargeNumbers */ addLargeNumbers("592", "3784"); /* Expected output */ 4376 b)  Implement a test program that demonstrates adding at least three pairs of large numbers (numbers larger than can be represented by a long). c) (1 point) Make sure your source code is well-commented, consistently formatted, uses no magic numbers/values, follows programming best-practices, and is ANSI-compliant.

Write a program to sort the element of I'd array is descending order and also implemented linear search on the same array both is storing and searching operation should be done inside one user defined function take so achieving the required functionality pass array into the function task from main using pass by reference oradress approach by c language

Using C++ programming language solve the following problem: You are given a character parenthesis array and an integer array. You need to find the maximum sum sub-array in the integer array such that the corresponding sub-array in the character array has balanced parenthesis. Formally, a balanced parenthesis is subset of { [,],{,},,(,) }* defined recursively as follows: • The empty string is balanced parentheses. If A is balanced parentheses, then so are the strings [A], {A}u , (A). If A and B are balanced parenthesis, then so is the string AB. Input Contains: First line contains T, the number of test cases. • First line of each test case contains integer N. • Next two lines contain the character array and the integer array respectively, each having N elements. Input: 1 -2 -1 34 Output: 7

Question- Need solution in JavaSomething related to IPO offeringmain gist is we had shares - lets say N which we want to divide among biddersBidders are represented in 2d arrays as[bidder_id, no of shares_bid, price, timestamp]Now build a function returns the bidder_id's in sorted array that did not receive any shares.   Shares are allocated following rules-   if the price is highest among all the bidders. Allocate shares If the price is same among 2 bidders. Allocate share in iterative fashion, first one get share had earlier timestamp.Like 2 bidders with bidder id 1&2, have same price, timestamp 4 and 1, bids for 5 shares each and N=1.So, in this case only bidder id 1 get share, bidder id 2 will not recieve any shares

in C language please

How can the function, matrix_multiply_unopt, be optimized and rewritten to run faster using with n having a size of 1600?   struct fn_args { int n; int *mem1; int *mem2; int *mem3; };   void matrix_multiply_unopt(struct fn_args *args) {int i, j, k, n;int *mat1, *mat2, *res; n = args->n;mat1 = args->mem1;mat2 = args->mem2;res = args->mem3; for(i = 0; i < n; i++){for(j = 0; j < n; j++){res[i * n + j] = 0;for(k = 0; k < n; k++){res[i * n + j] += mat1[i * n + k] * mat2[k * n + j];}}}}

In mathematics, Pascal's triangle is a triangular array of the binomial coefficients that arises in probability theory, combinatorics, and algebra. 1 1 1 1 12 1 1 3 2+1 1 Formula for Pascal's triangle is given by: n! 1 k! (n − k)! - where in denotes a row of the triangle, and k is the position of a term in the row. Create a function which takes a number and returns n top rows of Pascal's Triangle flattened into a one-dimensional list. Examples → pascals_triangle (1) [1] pascals_triangle (2) [1, 1, 1] pascals_triangle (4) → RUBY [1, 1, 1, 1, 2, 1, 1, 3, 3, 1]