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]

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

Mina always wants things to be sorted. She loves perfection in work and doesn't worry about time. Her brother gifted her some boxes with different sizes. Now she needs your help to sort it. You're given n boxes with different sizes and your task is to sort the boxes in ascending order of size. You should recursively partition the array with a number p so that all the elements greater than p are to its right and all the elements lower than p to its left to sort the boxes. Make sure you are giving a solution that doesn't exceed the time complexity of O(n^2), but on average has complexity of O(nlogn) a. Which algorithm will you suggest to Mina? Explain if your algorithm is stable or unstable with appropriate example b. Show the step by step simulation of your algorithm on the boxes of size 5, 9, 10, 3, 15, 12, 6, 20, 9, 13, 3, 10, 1, 2. c. Give an example of box sizes when it will be worst case and when it will be the best case for this algorithm.
In python, count the neighboring *'s of each individual element in this array: * * . . . . . . . . . * . . . then output an array where each element is replaced with the numbers of *'s above below and diagonal to them. The output should look like this: * * 1 0 0 3 3 2 0 0 1 * 1 0 0
Write a program that takes a sentence from user in an array and perform task (see picture)
A positive integer is called a perfect number if it is equal to the sum of all of its positive divisors, excluding itself. For example, 6 is the first perfect number because 6 = 3 + 2 + 1. (The same applies for 281+2+4+7+ 14). Write a program that creates an array of N integers (N = 3000) and fills it with random numbers between 1 and 200. The program has to count the number of perfect numbers in this array. To do that in less time, it breaks down the job between three threads: 1. threadLow: counts perfect numbers in the first part of the array. (From 0 up to 1000) 2. threadMiddle: counts perfect numbers in the second part of the array. (From 1000 up to 2000) 3. threadHigh: counts perfect numbers in the third part of the array. (From 2000 up to 3000) The parent (main) thread waits for them to finish, calculates the sum of the three values, and prints it. Note that the three threads have similar jobs to perform with some differences regarding the range of search in the array.
IN JAVA Given an array, write a program to print the array elements one by one in a new line. If the array element is divisible by 4, print Four. If it is divisible by 6, print Six. If it is divisible by both 4 and 6, print Four Six. Use the following input array Int[] input_array = {2, 5, 10, 8, 18, 24, 3, 48, 30, 9, 12} Output should be 2 5 10 Four Six Four Six 3 Four Six Six 9 Four Six
Solve by java
1. Write a program that fills an array with 10 random integer values between O and 100, your program should then calculate and print the alternating sum of all elements in the array. for example, if the array values are (89, 35, 44, 61, 66, 52, 45, 16, 48, 73) then the sum will = 89- 35 + 44 - 61 + 66- 52 + 45 - 16 + 48 - 73 = 55. Sample Run: The generated numbers are: 2 11 44 38 66 72 38 67 43 13 The alternating sum is -8 2. Write a program that reads 10 characters from user and store them in an array. Then display one or more of the following messages: 1. All characters are letters 2. All letters in the list are upper 3. There is no vowel letter in the list 4. There is at least 2 digits in the list 5. There is at least 3 symbols in the list Sample run 1: Enter 10 characters: AB1OK8 M& ? All letters in the list are upper There is at least 2 digits in the list There is at least 3 symbols in the list
Write a program in Java programming language that reads an array of integers! The program should output the average value computed from all even numbers in the array.
An input array consists of multiple integers. Write a sorting program to sort the content of thearray in place.Sample:Input: {4,2,0,3,4,0,4,1,2,1,3}Output: [0 0 1 1 2 2 3 3 4 4 4]
USE PYTHON 5.Write an algorithm that given a sequence of numbers, sorts, even numbers in ascending order, odd numbers in descending order and places all even numbers in the initial part of an array then odd numbers. Example: 2, 5, 1, 0, 4, 7, 9, 3, -2, 10, 20, 15 The answer is: -2, 0, 2, 4, 10, 20, 15, 9, 7, 5, 3, 1.
Write a program using Java programming language that reads an array of numbers and: Program writes all even numbers! Program writes the number of all negative numbers! Program writes the product of all numbers on odd indexes in the array!
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