Consider an array of N integers. Describe an algorithm with an 0(N) runtime that processes the array so that: All of the negative numbers are removed. All of the remaining numbers maintain their relative order. All the null elements are at the end. Note: This is not language specific, but you can assume that the array can have null elements. Examples: (a) Input: [0, 2, 8, 1, 0, 2] Output: [0, 2, 8, 1, 0, 2] (b) Input: [9, -1, 0, 4, -8, 0, 2] Output: [9, 0, 4, 0, 2, null, null] (c) Input: [-2, null, 8, -2, -1, -4, null] Output: [8, null, null, null, null, null, null]

Consider an array of N integers. Describe an algorithm with an 0(N) runtime that processes the array so that: All of the negative numbers are removed. All of the remaining numbers maintain their relative order. All the null elements are at the end. Note: This is not language specific, but you can assume that the array can have null elements. Examples: (a) Input: [0, 2, 8, 1, 0, 2] Output: [0, 2, 8, 1, 0, 2] (b) Input: [9, -1, 0, 4, -8, 0, 2] Output: [9, 0, 4, 0, 2, null, null] (c) Input: [-2, null, 8, -2, -1, -4, null] Output: [8, null, null, null, null, null, null]

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

please answer with a proper explanation and step by step solution Question: In computer science, a sorting algorithm is an algorithm that puts elements of a list into an order. Below is how the input array is represented ARRAY [] = [50, 11, 33, 21, 40, 50, 40, 40, 21]. Below is the expected output after sorting ARRAY [] = [11, 21, 21, 33, 40, 40, 40, 50, 50]. Write a Java program called SelectionSort that takes an input array [50, 11, 33, 21, 40, 50, 40, 40, 21] and generates an output array [11, 21, 21, 33, 40, 40, 40, 50, 50]. Test your program with different testcases and provide comments.
Write a program in java for the below given problem statement: Given 2 sorted arrays (in increasing order), find a path through the intersection that produces themaximum sum and return the maximum sum. That is, we can switch from one array to another array only atcommon elements. If no intersection element is present, we need to take the sum of all elements from thearray with greater sum.Sample Input:61 5 10 15 20 2552 4 5 9 15Sample Output :81Explanation :We start from array 2 and take sum till 5 (sum = 11). Then we'll switch to array at element 10 and take till15. So sum = 36. Now, no elements are left in array after 15, so we'll continue in array 1. Hence the sum is81.
FOR JAVA Write a Java method that takes two 2 dimensional int arrays (a and b) and a 2 dimensional boolean array (c) where all three arrays have the same size. Your method should return an array (result) such that, if a partic- ular element in c is true, then the corresponding (same indexed) element in result must be the multiplication of the the corresponding elements of a and b. If the element in c is false, then the the corresponding element in result must be the negative of multiplication of the the corresponding element in a and b. For example ifa = {{1,2,3},{4,5}},b = {{1,2,1},{0,2}} andc = {{true,false,true},{false,true}}, then the result should be result={{1, -4, 3}{0, 10}}.
in java , Consider the array of integers A={ 49, 26, 93, 17, 77, 31, 44, 55, 23}. Now, Perform the following sorting operations on ‘A’: Using Insertion sort, show how array would look like after each step. Using quick sort, show how array will be partitioned (first partition only) choose 23 the pivot element.
The Sieve of Eratosthenes is an algorithm that finds all prime numbers up to a given limit, n. It works by creating an array of Booleans, flag, of size n+1, initializing the array to true (assuming every number is a prime number in the beginning), and iteratively traversing the numbers from 2 to n, setting the values of indices that are multiples of other numbers to false. Write a program using the algorithm above, and display all the prime numbers up to 50.
Write a program in Java to implement Quick sort algorithm to sort a given set of elements and determine the time required to sort the elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted and plot a graph of the time taken versus n. The elements can be read from keyboard, a file or can be generated using the random number generator.
Suppose we have two arrays, a and b, containing numbers of size n and m, respectively. a and b array; Write a program that collects the elements of a that are different from b into another array c in C language and calculate the number of steps and time complexity of the algorithm?
Write an algorithm that sorts a list of n items by dividing it into three sublists of about n/3 items, sorting each sublist recursively and merging the three sorted sublists. Analyze your algorithm, and give the results under order notation.
Suppose we have two arrays, a and b, containing numbers of size n and m, respectively. a and b array; All elements of a and b (only one copy of common elements) in another array c Write the adder program in C and calculate the number of steps and time complexity of the algorithm?
Write a Java program to find the median of all elements in an array of integers. The median is the middle value in an ordered set of numbers. If the number of elements is even, the median is the average of the two middle values. Crease a class name Task5. There should be a main method and a “findMedian” method to find out the median of an input array.
Write a program in Java to implement the Insertion sort algorithm to sort a given set of elements and determine the time required to sort the elements. Repeat the experiment for different values of n, the number of elements in the list to be sorted, and plot a graph of the time taken versus n. The elements can be read from a file or can be generated using the random number generator
Given an unsorted array A of integers of any size, n ≥ 3, and an integer value x, write an algorithm as a pseudo code (not a program!) that would find out if there exist EXACTLY3 occurrences in the array with value x. What is the time complexity of your algorithm, in terms of Big-O? What is the space complexity of your algorithm, in terms of Big-O? What if , the given array A is sorted. Will time complexity change from the case that A was unsorted? • If yes; give a new algorithm that achieves this better complexity (indicate the time complexity as of that algorithm). • If no, explain why such new constraints/conditions cannot lead to a better time complexity.