Isabel has an interesting way of summing up the values in an array A of n integers, where n is a power of two. She creates an array B of half the size of A and sets B[i] = A[2i] + A[2i+1], for i = 0, 1,..., (n/2) - 1. If B has size 1, then she outputs B[0]. Otherwise, she replaces A with B, and repeats the process. What is the running time of her algorithm?

Isabel has an interesting way of summing up the values in an array A of n integers, where n is a power of two. She creates an array B of half the size of A and sets B[i] = A[2i] + A[2i+1], for i = 0, 1,..., (n/2) - 1. If B has size 1, then she outputs B[0]. Otherwise, she replaces A with B, and repeats the process. What is the running time of her algorithm?

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

Write a program that has an double array intArray[] that has N elements and is initialized with values start from 0 and incremented by 1 and then multiplied by 2. Your task is to print the address of the odd index and its value. [Note: you can define the value of N at least 10 or more] PLEASE DO NOT USE ANY INDEX TO ACCESS ELEMENTS OF THE ARRAY. Sample Output:Elements of intArray:0 24 6 8 10 12 14 16 18The address of index 1 is: Ox7ffebe1108c4 and the vlaue holds is 2The address of index 3 is: 0x7ffebe1108cc and the vlaue holds isThe address of index 5 is: 0x7ffebe1108d4 and the vlaue holds is 10The address of index 7 is: 0x7ffebe1108dc and the vlaue holds is 14The address of index 9 is: 0x7ffebe1108e4 and the vlaue holds is 18
Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have exactly one solution, and you may not use the same element twice. You can return the answer in any order. please do in python
Consider an array of length n containing unique integers in random order and in the range 1 to n + 1. For example, an array of length 5 would contain 5 unique integers selected randomly from the integers 1 through 6. Thus, the array might contain 3 6 5 1 4. Of the integers 1 through 6, notice that the 2 was not chosen and is not in the array. Write Java code that finds the integer that does not appear in such an array. Your solution should use a. O(n²) operations
create a generic array stack and push/pop a million random ints using java.util.Random class. you also want to detect the time it takes to push and pop elements from the stack and you need to run the test multple times to see how the running time grows with increasing number of operations. use a outer loop that runs the program a million times (e.g. for(int i = 1; i<1000000; i+=1000000)).
Using JAVA, write a method that swaps two rows of a two-dimensional array. The row indices to be swapped are passed as parameters to the method (Assume row indices are valid indices). Write a test program to demonstrate correct operation of the method.
In Java, please solve and don't copy from wrong answers. I need the JAVA CODE, not an answer like answering the question. An array A contains n−1 unique integers in the range [0,n−1], that is, there is one number from this range that is not in A. Design an O(n)-time algorithm for finding that number. You are only allowed to use O(1) additional space besides the array A itself. DO NOT SORT THE ARRAY. Must provide a test application with at least 2 sets of numbers. Hint: find smallest, largest, and sum. Compare the sum with the series summation??
It is required that all rows in a 2-dimensional array have the same number of columns. To put it another way, we can only construct 2-D arrays of square or rectangular dimensions. True False in the programming language Java
Write a Java method that counts increasing sets in an integer array. The sets do not overlap. Example: 10,9,9,4,5 Output would be 3(10) (9,9) (4,5)
Please code in python.Given an array of integers a of even length, your task is to split it into two arrays of equal length such that all the numbers are unique in each of them. There may be more than one possible answer, in which case you may return any of them. If there are no possible answers, return an empty array. Hint: Count the number of occurrences of each integer in a. If there are integers occurring more than twice, then there is no solution. Next, put the integers occurring twice into both answer arrays. Finally, put all other numbers in the answer arrays, following the condition that they should have equal sizes. Example • For a = [2, 1, 2, 3, 3, 4], the output can be solution(a) = [[2, 1, 3], [2, 3, 4]]. Answers like [[1, 2, 3], [2, 3, 4]] or [[4, 2, 3], [3, 2, 1]] would also be considered correct. • For a = [1, 2, 2, 1], the output can be solution(a) = [[1, 2], [2, 1]]. Again, there are other possible answers. • For a = [2, 2, 3, 3, 2, 2], the output should be solution(a)…