def summation (array): a = 0 for i in array: a = a + i a return a #Run time for first array with n = 10 start time.time() summation ([85,49,14,11,33,94,30,20,25,33]) print("Execution time for 1st array: {}".format(time.time() #Run time for second array with n = 25 start= time.time() summation ([92,14,67,52,77,65,88,27,84,94,35,70,89, 80, 35,55,7 print("Execution time for 2nd array: {}".format(time.time() Execution time for 1st array: 0.0 Execution time for 2nd array: 0.001001119613647461 What is the running time complexity of the algorithm.

def summation (array): a = 0 for i in array: a = a + i a return a #Run time for first array with n = 10 start time.time() summation ([85,49,14,11,33,94,30,20,25,33]) print("Execution time for 1st array: {}".format(time.time() #Run time for second array with n = 25 start= time.time() summation ([92,14,67,52,77,65,88,27,84,94,35,70,89, 80, 35,55,7 print("Execution time for 2nd array: {}".format(time.time() Execution time for 1st array: 0.0 Execution time for 2nd array: 0.001001119613647461 What is the running time complexity of the algorithm.

Microsoft Visual C#

7th Edition

ISBN:9781337102100

Author:Joyce, Farrell.

Publisher:Joyce, Farrell.

Chapter6: Using Arrays

Section: Chapter Questions

Problem 19RQ

See similar textbooks

Similar questions

void changeAll(int x[]) { x[0] = x[0] + 5; return; The first element in an array would be increased by 5 The array would be the same because it was passed by value x would be increased by 5 All the elements in the passed array would be incremented by 5
Code Big Oh Notation my array = array(ï,[1,2,3,4,5|) for i in my_array print(i) 1. Code Big Oh Notation _print("Step 2") print(my_array[3]) 2. Code Big Oh Notation 3. print("Step 3") my_array.append(6) print(my array)
void showArray ( int a[ ], int size ); // shows the array in the format "int a [ ] = { 3, 7, 4, ... ,5, 6, 3} void showReverse ( int a[ ], int size ); // shows the array in reverse "int a [ ] = { 3, 6, 5, ... , 4, 7, 3 } " int lowest ( int a[ ], int size ); // finds and returns the lowest value in the array (should be 3) int highest ( int a[ ], int size ); // finds and returns the highest value in the array (should be 7) int sumArray ( int a[ ], int size ); // calculates and returns the sum of all values in the array float averageVal ( int a[ ], int size ); // calculates and returns the average of all values in the array int count5 ( int a[ ], int size ); // returns how many times the number 5 appears in the array int firstMinusLast ( int a[ ], int size ); // returns the difference b/w the First and Last Array Element void showBeforeIndex( int a [ ], int index); // shows all array values before a specific index void done…
1. Shift Left k Cells Use Python Consider an array named source. Write a method/function named shiftLeft( source, k) that shifts all the elements of the source array to the left by 'k' positions. You must execute the method by passing an array and number of cells to be shifted. After calling the method, print the array to show whether the elements have been shifted properly. Example: source=[10,20,30,40,50,60] shiftLeft(source,3) After calling shiftLeft(source,3), printing the array should give the output as: [ 40, 50, 60, 0, 0, 0 ]
//convert array of numbers from farenheit to celcius// example:// argument: [23, 32, 41, 50, 59]// return: [-5, 0, 5, 10, 15]// hint: use Array.mapfunction toCelcius(array){ } //write a function that takes an input array and returns an array of booleans (>=75) or fail (<75)// example:// argument: [20, 30, 50, 80, 90, 100]// return: [false, false, false, true, true, true]// hint: use Array.mapfunction passOrFail(array){ }
8. Repetition Use Python Language Write a method that takes in an array as a parameter and counts the repetition of each element. That is, if an element has appeared in the array more than once, then its 'repetition' is its number of occurrences. The method returns true if there are at least two elements with the same number of 'repetition'. Otherwise, return false. Input: {4,5,6,6,4,3,6,4} Output: True Explanation: Two numbers repeat in this array: 4 and 6. 4 has a repetition of 3, 6 has a repetition of 3. Since two numbers have the same repetition output is True. Input: {3,4,6,3,4,7,4,6,8,6,6} Output: False Explanation: Three numbers repeat in this array:3,4 and 6 .3 has a repetition of 2, 4 has a repetition of 3, 6 has a repetition of 4. Since no two numbers have the same repetition output is False.
For the array ADT, the operations associated with the type array are: insert a value in the array, delete a value from the array, and test whether a value is in the array or not. 1.true 2.false
Assume that the following program segment is executed. What is the first element of testArray3 after the execution of the statement sortArray2(testArray3);? *
2 #include 3 #include 4 5 6 7 8 void printArray(int myArr[][ARRAY_COLS]) 9- { 10 11- 12 13- const int ARRAY_COLS = 10; 3; const int ARRAY_ROWS 14 15 16 17 18 } 19 20- /* 21 26 27 } 37 } 38 44 45 46 47 48 49 50 for (int i = 0; i < ARRAY_ROWS; i++) { 22 23 */ 24 void zeroCorners (int myArr[] [ARRAY_COLS]) 25 - { myArr[0][0] = 999; 51 52 } This function currently sets the upper-left-hand corder of the 2D array to 999 Instead, this should set all 4 corners of the 2-D array to zero. for (int j = 0; j < ARRAY_COLS; j++) { std::cout << myArr[i][j] << ", "; } 28 29 - /* 30 This function should Loop through every element in the 2-D array. If an element is odd, then subtract one from to make it even. 31 32 HINT: function printArray() is an example of Looping through every element in 2D array */ 33 34 void makeEven (int myArr[][ARRAY_COLS]) 35 - { 36 // TODO - put code here std::cout << "\n"; 53 54 } 55 39 int main() 40 - { 41 - 42 43 int arr[][ARRAY_COLS] { {1, 2, 3, 4, 5, 6, 7, 8, 9, 10),…
def clipping_2d_array(array, threshold):"""Iterate through each element of the 2d array using nested loops.Set the values greater than a threshold value equal to the threshold value given as an input parameter.(E.g. if the threshold is 1 and there is a value 1.5, set the value to 1 in the array):param array: a 2d array:param threshold: a threshold value (valid int or float)"""pass
//Required Functionvoid func(int array_1[],int array_2[],int size){ for(int i=0;i<size;i++){ if(array_2[i]>array_1[i]){ array_1[i]=array_2[i]; } } return;} //main function to test the function.int main(){ int size=6; int a[]={1,5,9,8,7,6}; int b[]={1,4,10,12,7,15}; printf("First array before function call: "); for(int i=0;i<size;i++){ printf("%d ",a[i]); } func(a,b,size); //call to the created function printf("\nFirst array after function call: "); for(int i=0;i<size;i++){ printf("%d ",a[i]); } return 0;} 1. Write the statements to do the following: write a prototype for your function in the previous problem write a main function which includes the following steps declare two arrays of ints with 25 elements each prompt the user and read values into both arrays call your function from the previous problem print both arrays
classHighArrayApp { public static void main(String[] args) { intmaxSize=100;// array size HighArrayarr;// reference to array arr=newHighArray(maxSize);// create the array arr.insert(77);// insert 10 items arr.insert(99); arr.insert(44); arr.insert(55); arr.insert(22); arr.insert(88); arr.insert(11); arr.insert(00); arr.insert(66); arr.insert(33); arr.display();// display items intsearchKey=35;// search for item if(arr.find(searchKey)) System.out.println("Found " + searchKey); else System.out.println("Can’t find " + searchKey); arr.delete(00);// delete 3 items arr.delete(55); arr.delete(99); arr.display();// display items again }// end main() }// end class HighArrayApp // highArray.java // demonstrates array class with high-level interface // to run this program: C>java HighArrayApp //////////////////////////////////////////////////////////////// class HighArray { private long[] a; // ref to array a private int nElems; // number of data items…