Consider the pair of functions below. Between the two functions, which runs the fastest (i.e. uses the fewest number of operations), and which function runs the slowest? Does the size or order of the input change the order ranking? i.e. if the input was an array of ten million items instead of 100 or if the data was sorted (or unsorted) does the efficiency of each function change? Pair #1 def func_one(my_array): if len(my_array) > 1: mid= len(my_array)//2 L = my_array[:mid] R = my_array[mid:]

Consider the pair of functions below. Between the two functions, which runs the fastest (i.e. uses the fewest number of operations), and which function runs the slowest? Does the size or order of the input change the order ranking? i.e. if the input was an array of ten million items instead of 100 or if the data was sorted (or unsorted) does the efficiency of each function change? Pair #1 def func_one(my_array): if len(my_array) > 1: mid= len(my_array)//2 L = my_array[:mid] R = my_array[mid:]

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Language is C, please code according to parameters, answer as simply as possible, need ASAP. Thank you! Write two functions, total_product and total_sum. Both functions return an integer. Total_product function takes in a 2D array of integers along with an integer with the number of rows and columns. This function will return an integer with the product of the sum of the rows. See example for details. The total_sum function takes in an array of integers with the size of the array. The total_sum function will find the sum of the 1D array. You must call the total_sum function in the total_product to receive full credit. Example: row/column 0 1 2 3 total_sum(row) Result 0 1 2 3 4 10 1 5 6 7 8 26 Given this 2D array above, the answer for total_product would be 260. Because row one adds up to be 10, and row two adds up to be 26. We multiple this together to get total product.
Write a function to replace all the element below the main diagonal in 3x3 2D-array with zeros. Then write only the call statement to call the function.
Need some help on this Python Quesion
Suppose that a company's employee data is stored in a matrix like the one in the image example: Each row of the matrix has four entries, representing the name, registration, sector, and telephone information of an employee, in that order. The number of lines depends on the number of employees. All matrix entries are in string format. Write a function that receives an array like the one in the example and performs a search by sector, that is, given a name of a sector of the company, the function returns the data of all employees of that sector. For example: searchSector(P,‘Contabilidade’) = [[‘Adalberto Ferreira’, ‘1091982’, ‘(21)99281-2983’],[‘FlaviaAmorim', '1128938', '(22)99273-9404']]where P is the matrix of the image example. If no record is found, the function should return to ‘No records found’ message. Complete the exercise presented above by interacting with the user, askinghave it type the array (at once or element by element), and then print amatrix with the results obtained…
13. While dictionaries are designed so that we can find a value based on a key, every so often we need to perform a reverse lookup. For example, imagine a dictionary where the keys are names and the values are phone numbers. Usually we want to find the phone number based on the name, but occasionally you might need to find a name based on the phone number. Write a function called reverse_lookup(dictionary, value) that returns all the keys in the dictionary associated with the specified value. Note: In dictionaries, the keys are guaranteed to be unique, but the values are not. So your function should return a list containing all of the matching keys (if any) Example: Given this dictionary, groups = {'Apple': 'Fruit', 'Spinach': 'Vegetable', 'Banana': 'Fruit'} reverse_lookup (groups. Vegetable') ["Spinach'] reverse_lookup (groups, Fruit') ['Apple'. 'Banana'] reverse_lookup (groups. 'Meat') []
Given two sorted arrays, write a function to merge them into a single sorted array. What is the time complexity of your solution?
The program is to be written in C language and only one array is to be used. The input is to be given during compile time. The question is in the image.
in C
Instructions at the top of page for what functions can be used. Answer question 1 only please.
Give me an in depth step by step explanation on how to solve this problem including a step by step explanation on how the ogic works for each answer choice.10. Consider two parallel arrays which contain the names and corresponding scores of players in a trivia game.String names "Rob", "Pam", "Sandy", "Kelly", "Kim", "J.P."}; int I scores = (2600, 2420, 1790, 2100, 3100, 3250);Which of the following code segments correctly prints the names and scores of all the players who scored above high?(A) for (int element scores) if (element> high) System.out.print In (names + " " + element);(B) for (int element scores)if (element >= high)System.out.println(names" "+element); (C) for (int i = 0; i < scores.length; i++)if (scores [i]> high) System.out.println(names [i] + " " + scores [i]);(D) for (int i = 0; i < scores.length; i++) System.out.println (names [i]+"" + scores [i]);if (scores [i] >= high)if (scores [i] high)(E) for (int i = 0; i <= scores.length; i++)…
. Initialize please.
Write a function to sort data (in increasing order) in an array using a. pass by value b. and pass by reference.