Answered: For each of the following program… | bartleby

Related questions

Question

100%

For each of the following program fragments:
Give an analysis of the running time (Big-Oh). Justify your answer?
A.
public class GFG {
// Linearly search x in att[]. if x is present then
//return the index, otherwise return -1
static int search (int arr[], int n, intx)
{
int i;
for (i = 0: i<n;i++){
if (arr[i] ==x){
return i;
}
}
return -1;
}

B.
sum=0;
for(i=0; i<n; i++)
for(j = 0; j <i* i; j++ )
for(k = 0; k<j; k++ )
sum++;

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 3 steps

SEE SOLUTION Check out a sample Q&A here

Blurred answer

Similar questions

provided code: import java.util.Comparator; /** * Your implementation of various iterative sorting algorithms. */public class Sorting { /** * Implement bubble sort. * * It should be: * in-place * stable * adaptive * * Have a worst case running time of: O(n^2) * And a best case running time of: O(n) * * NOTE: You should implement bubble sort with the last swap optimization. * * You may assume that the passed in array and comparator * are both valid and will never be null. * * @param <T> Data type to sort. * @param arr The array that must be sorted after the method runs. * @param comparator The Comparator used to compare the data in arr. */ public static <T> void bubbleSort(T[] arr, Comparator<T> comparator) { // WRITE YOUR CODE HERE (DO NOT MODIFY METHOD HEADER)! } /** * Implement selection sort. * * It should be: * in-place * unstable…
Optimization: make the input as big or as small as possible in Python using Newton and Bisection methods. The second picture below is another example from other problems we did. Please show your codes.
Consider the following multiplication problem: Given an integer list (an array) of size n, we want to calculate the product of all numbers in the list and display the result. (a) Define an instance of a problem in general. (b) Specify two different instances of the multiplication problem defined above. (c) What is the solution for each instance in part (b). How did you come up with that solution?
Give a recursive definition for the set of all strings of a’s and b’s that begins with an a and ends in a b. Say, S = { ab, aab, abb, aaab, aabb, abbb, abab..} Let S be the set of all strings of a’s and b’s that begins with a and ends in a b. The recursive definition is as follows – Base:... Recursion: If u ∈ S, then... Restriction: There are no elements of S other than those obtained from the base and recursion of S.
Solved in python
1 public static int sum(int x, int y){ 2 int z = x +y; 3 return z; 4 } 5 public static void main(String[] args){ 6 … 7 sum(a+2, b); 8 … 9 } write the signature of the method sum: sum(int,int) *Method name/parameter list list local variables of sum: x, y, and y are local variables of the function. list the parameters of sum: int x, int y write the line number where a call to sum occurs 7 list the arguments for the above call list the return type of sum here ______________
You are given an array-like data structure Listy which lacks a size method. It does, however, have an elementAt ( i) method that returns the element at index i in 0( 1) time. If i is beyond the bounds of the data structure, it returns -1. (For this reason, the data structure only supports positive integers.) Given a Listy which contains sorted, positive integers, find the index at which an element x occurs. If x occurs multiple times, you may return any index. Write code with explanation
The following recursive method called z is created. This method accepts two parameters: A string s, and an integer index The code in the method is: if (index == s.length()) return ""; <------ base case if(index % 2 == 0) return ""+ s.charAt(index) + z(s,index+1); <---- recursive call else return z(s,index+1); <----- recursive call What would be the output with the call: z("javajavajava",0);
In questions 4-10 estimate the Big O value by analyzing the code. Note the algorithms are written in English. Hint: you are interested in the number of operations for each algorithm.
Exercise 1 Given the following recursive version of selection sort:public void recursiveSelectionSort(int a[], int n, int index){if (index == n)return;int k = minIndex(a, index, n-1);if (k != index)swap(a, k, index);recursiveSelectionSort(a, n, index + 1);}minIndex is a separate function that finds the smallest value in the given array “a” from“index” to “n-1” index values.swap is a separate function that swaps elements in the given array “a” between theelements at index “k” and “index” respectively.Assuming these 2 functions work as expected, there may be an error with therecursiveSelectionSort code. Answer the following:1) Design your own set of 8 unsorted integers in an array2) Determine what the given code will produce with your array by describing what thearray looks like with each recursive instance of recursiveSelectionSort3) If the code does have an error, describe the error, where it is, and how you would fixitFor example, if you said your array was [4 2 3 1 5 6 7 8], then…
I need question 2 ans previous question 1 has been answered
Complete the combinations function to generate all combinations of the characters in the string s with length k recursively

SEE MORE QUESTIONS