You’re writing a function in C++ that accepts an array of distinct integers from 0, 1, 2, 3...up to N. However, the array will be missing one integer, and your function is to return the missing one. For example, this array has all the integers from 0 to 6, but is missing the 4: [2, 3, 0, 6, 1, 5] Therefore, the function should return 4. The next example has all the integers from 0 to 9, but is missing the 1: [8, 2, 3, 9, 4, 7, 5, 0, 6] In this case, the function should return 1. Using a nested-loops approach would take up to O(N^2). Your job is to optimize the code so that it has a runtime of O(N).

You’re writing a function in C++ that accepts an array of distinct integers from 0, 1, 2, 3...up to N. However, the array will be missing one integer, and your function is to return the missing one. For example, this array has all the integers from 0 to 6, but is missing the 4: [2, 3, 0, 6, 1, 5] Therefore, the function should return 4. The next example has all the integers from 0 to 9, but is missing the 1: [8, 2, 3, 9, 4, 7, 5, 0, 6] In this case, the function should return 1. Using a nested-loops approach would take up to O(N^2). Your job is to optimize the code so that it has a runtime of O(N).

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 44SA

See similar textbooks

Similar questions

You are asked to write a C function that finds the longest sequence of increasing numbers in an array. You should implement a function that receives an array passed as a parameter, and prints the longest sequence of increasing numbers. The prototype of the function MUST be: void longestSequence(int a[], int sizeA); For example, we have an int array with values as 1, 3, 10, -1, 7, 6, 10, 30, 0. Your code should identify the longest sequence of increasing numbers and print Longest sequence is -1, 7, 6, 10, 30. Array size cannot be 0
Help writing a program in c++ that asks a user for a number (variable num) and then takes that number input to print out the nth term of a sequence? The sequence begins with 1 and then every number after is a prime factor of 3, 4, or 6. This needs to be done without using vectors or arrays. . . . For example: Sequence is : 1, 3, 4, 6, 8, 9, 12, 16, 18, 20, ... (cont.) User input (num) is : 6 Output : 12 (6th term) . . Please add comments explaining the code for better understanding if possible, thank you!!
Given the code segment below, what should be the data type of a in the function prototype of func(), given the call from main()? Do NOT use array indexing notation. If it is an invalid access, write INVALID (in all capital letters) as your answer. void func( ______ a);int main(){ double aData[15];func(*aData + 15);return 0;}
How come we can pass an array name as an argument to a function and still be able to persist the change? in C++
Write in a programming language (PL), a program to fill an NxN two- dimensional array, in a circular (spiral) pattern, with numbers from 1 to N2 as described below. You can do that by writing first the following functions/procedures which you will call in the main program. The procedure FillColumnUpward(A, top, bottom, left, z) which takes the array A the top, bottom and left as parameters and iterates through the left column from bottom to top to fill the column.
Write a C function (only a function) that takes an array of integers called arr and the array size called s as parameters. Your function should then reverse the content of the array ( NOT print it in reverse order but actually reverse the content). for example if the array has the values 7,2,4,6,5 then the values in the array should become 5,6,4,2,7).
I need help with this in C++: Write a pair of functions countEven(int *, int) and countOdd(int *, int) which receive an integer array and its size, and returns the count of even or odd numbers in the array.
In C++, Can you please look at the code below and revise/fix so it will work according to instructions and criteria. Instruction 1) Write a function that copies a 1D array to a 2D array. The function’s prototype is bool copy1DTo2D(int d1[], int size, int d2[][NCOLS], int nrows); where size > 0 NCOLS > 0 nrows > 0 NCOLS is a global constant size = NCOLS * nrows the function returns true if the parameters and constants satisfy these conditions and false otherwise. the relation between 1d array indices and 2d array indices is 2d row index = 1d array index / NCOLS 2d column index = 1d array index modulus operator NCOLS 2) Write a function that copies a 2D array to a 1D array. The function’s prototype is bool copy2DTo1D(int d2[][NCOLS, int nrows, int d1[], int size); where size > 0 NCOLS > 0 nrows > 0 NCOLS is a global constant the function return true if the parameters and constants satisfy these conditions and false otherwise. the relation between 1d array indices and…
You’re writing a function that accepts an array of unsorted integers and returns the length of the longest consecutive sequence among them. The sequence is formed by integers that increase by 1. For example, in the array: [10, 5, 12, 3, 55, 30, 4, 11, 2] the longest consecutive sequence is 2-3-4-5. These four integers form an increasing sequence because each integer is one greater than the previous one. While there’s also a sequence of 10-11-12, it’s only a sequence of three integers. In this case, the function should return 4, since that’s the length of the longest consecutive sequence that can be formed from this array. One more example: [19, 13, 15, 12, 18, 14, 17, 11] This array’s longest sequence is 11-12-13-14-15, so the function would return 5. Your job is to optimize the function so that it takes O(N) time.
Write in a programming language (PL), a program to fill an NxN two- dimensional array, in a circular (spiral) pattern, with numbers from 1 to N2 as described below. You can do that by writing first the following functions/procedures which you will call in the main program. The procedure FillRowForward(A, top, left, right, z) which takes the array A the top, left and right as parameters and iterates through top row from left to right to fill the row. z is as used in the algorithm.
You are designing a function that will manipulate an array of integers. It needs to work for arrays of any length. What is the minimum number of parameters your function will have?
Suppose you are given an array of integers and a target sum. Write a function that finds all pairs of integers in the array that add up to the target sum. Your function should return an array of arrays, where each inner array contains two integers that add up to the target sum. You may assume that the input array is not empty and that all elements are unique. For example, if the input array is [3, 5, 2, -4, 8, 11] and the target sum is 7, your function shou return [[3, 4], [2, 5], [-4, 11]]. Solve it in C# language