Use a one dimensional array to solve the following problem using HTML and JavaScript. Read in 10 numbers, each of which is between 10 and 100. As each number is read, print it only if it’s not a duplicate of a number that has already been read. Provide for the “worst case,” in which all 10 numbers are different. Use the smallest possible array to solve the problem.

Use a one dimensional array to solve the following problem using HTML and JavaScript. Read in 10 numbers, each of which is between 10 and 100. As each number is read, print it only if it’s not a duplicate of a number that has already been read. Provide for the “worst case,” in which all 10 numbers are different. Use the smallest possible array to solve the problem.

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter6: Arrays

Section: Chapter Questions

Problem 17RQ

See similar textbooks

Similar questions

Use a one-dimensional array to solve the following problem: Read in 10 numbers, each of which is between 10 and 100. As each number is read, print it only if it's not a duplicate of a number that has already been read. Provide for the "worst case", in which all 10 numbers are different. Use the smallest possible array to solve this problem. This needs to be in Java and Html.
Please solve not copy wrong answer from other website ???? Consider arrays A and B, each of which is indexed from 1 to n. The array entries are bank customerPIN numbers, where a PIN number is a sequence of exactly 3 digits (ex. 460 or 013 are each valid PINs).Array A consists of the PIN numbers of customers from bank A, and array B consists of the PIN numbersof customers from bank B. Your job is to design an algorithm that outputs all safe passwords from bankA. The safe passwords from bank A are those which are used by a customer from bank A but not alsoused by a customer in bank B. Write the pseudo-code for your algorithm, and justify why it runs in timeO(n) in the worst-case.
By using JavaScript find the sum of all the elements of a given array (before removing and after removing) and removes the last element from an array? [2, 3, 4, 6, 30, 23] Answer it as soon as possible to get the upvot.
You are given two arrays, one shorter (with all separate items) and one longer (with no unique elements). Find the shortest subarray in the larger array that contains all of the shorter array's items. The things can be shown in any order.EXAMPLEInput: {1, 5, 9}{7, 5, 9, 0, 2, 1, 3, 5. 7, 9. 1, 1, 5, 8, 8, 9, 7}Results: [7, 10] (the underlined portion above)
Suppose you have given a circular array of integers where start and size is given. You need to find the second largest even number and second smallest even number of the array. After that, replace the next index value of the second largest even value index with summation of the second largest even value and second smallest odd value, and previous index value of the second smallest even value index with the multiplication of the second largest odd and second smallest even value. Note: You must change the start and size accordingly. Assume that O represents empty spaces in the array. [You are not allowed to use any additional array/list or any built-in functions except lenO, range0].
Please use a different code to solve this question Given an string representing a 2D array of integers that contains the locations of the two skyscrapers, find the shortest possible path that connects the two skyscrapers and return the length of that path. A skyscraper is defined to be a 4-directionally connected group i.e. North-South-East-West, no diagonals), and can consist of multiple "parts" such that the initial size of the skyscraper is not one single cell. 1's represent a cell that is part of the skyscraper, and 0's represent cells that are empty air. You will join the path to the other skyscraper by adding planks to spots containing 0's where each cell represents one unit of distance. You can only add planks to spots connected to either a skyscraper or another 2x4 (i.e. you cannot "jump" over a gap), and you can only do so 4-directionally. Return the smallest number of planks needed to make the crossing. Case 1: Input: {[1,0,0,0],[0,0,0,0],…
Write a program that fills an integer array of size 1000 with random positive integers between 1 and 10.Assume that each element represents a different city and the integers stored in the array represent thenumber of golds in those cities. The program traverses over the array and collects the golds at each city,starting from a random position. When the program visits a certain city, all of the golds are collected,and the visited element of the array becomes 0 (no gold is left at that city.) The journey continues withthe rule given below. If the position at the nth step is denoted by pn, and the number of golds at the citypn is denoted by gn,??+1 = {| ((??−1 + ?? + ??) ???1000|, ????? 2 = 0| ((??−1 + ?? − ??) ???1000|, ????? 2 = 1.The program continues visiting cities until the last three visited city has no gold.The program, at each visit, should print out the following information:• The current city index (pn).• The previous city index (pn-1).• The number of golds at the current city…
Take an array of length n where all the numbers are nonnegative and unique. Find the element inthe array possessing the highest value. Split the element into two parts where the first part containsthe next highest value in the array and the second part holds the required additive entity to get thehighest value. Return the array index value. Consider the negative numbers as well.Input: [4, 8, 6, 3, 2]Output: [4, 6, 2, 6, 3, 2]
Use a one-dimensional array to solve the following problem. Read in 20 numbers, each of which is between 10 and 100, inclusive. As each number is read, validate it and store it in the array only if it is not a duplicate of a number already read. After reading all the values, display only the unique values that the user entered. Provide for the “worst case” in which all 20 numbers are different. Use the smallest possible array to solve this problem.
Use a one dimensional array to solve the following problem using HTML and JavaScript. A company pays its salespeople on a commission basis. The salespeople receive $200 per week plus 9 percent of their gross sales for that week. For example, a salesperson who grosses $5000 in sales in a week receives $200 plus 9 percent of $5000, or a total of $650. Write a script (using an array of counters) that obtains the gross sales for each employee through an HTML5 form and determines how many of the salespeople earned salaries in each of the following ranges (assume that each salesperson’s salary is truncated to an integer amount): $200-299 $300-399 $400-499 $500-599 $600-699 $700-799 $800-899 $900-999 $1000 and over
Determine if the sum of two integers is equal to the given value Given an array of integers and a value, determine if there are any two integers in the array whose sum is equal to the given value. Return true if the sum exists and return false if it does not. Consider this array and the target sums: 5 | 7 | 1 | 2 | 8 | 4 | 3 Target Sum107+3=10, 2+8=10 Target Sum19No 2 values sum up to 19 You can use the following algorithm to find a pair that add up to the target (say val). Scan the whole array once and store visited elements in a hash set. During scan, for every element e in the array, we check if val - e is present in the hash set i.e. val - e is already visited. If val - e is found in the hash set, it means there is a pair (e, val - e) in array whose sum is equal to the given val. If we have exhausted all elements in the array and didn’t find any such pair, the function will return false
Given two d-dimensional MBRs, E1 = (x1min, x1max; x2min, x2max; …; xdmin, xdmax) and E2 = (y1min, y1max; y2min, y2max; …; ydmin, ydmax) (note: both E1 and E2 are represented by an array in the code), please give the pseudo code to check whether or not two MBRs are intersecting with each other. If yes, please return true; otherwise, return false.