Javanetbeans   Use a one-dimensional array to solve the following problem: Write an application that inputs five numbers each of which is between 10 and 100, inclusive. As each number is read, display it only if it is not a duplicate of a number already read. Provide the “worst case”, in which all five numbers are different. Use the smallest possible array to solve this problem. Display the complete set of unique values input after the user inputs each new value   Initialize the integer array numbers to hold five elements. This is the maximum number of values the program must store if all values are input. 2. Validate the input and display an error message if the user inputs invalid data. 3. If the number entered is not unique, display a message to the user; otherwise, store the number in the array and display the list of unique numbers entered so far.

Alert dont submit AI generated answer.

Using jGRASP please de-bug this /**This program demonstrates an array of String objects.It should print out the days and the number of hours spent at work each day.It should print out the day of the week with the most hours workedIt should print out the average number of hours worked each dayThis is what should display when the program runs as it shouldSunday has 12 hours worked.Monday has 9 hours worked.Tuesday has 8 hours worked.Wednesday has 13 hours worked.Thursday has 6 hours worked.Friday has 4 hours worked.Saturday has 0 hours worked.Highest Day is Wednesday with 13 hours workedAverage hours worked in the week is 7.43 hours*/{public class WorkDays{public static void main(String[] args){String[] days = { "Sunday", "Monday", "Tuesday","Wednesday", "Thursday", "Friday", "Saturday"}; int[] hours = { 12, 9, 8, 13, 6, 4}; int average = 0.0;int highest = 0;String highestDay = " ";int sum = 0; for (int index = 0; index < days.length; index++){System.out.println(days[index] + " has "…

Can you write it in Java, add comments    Create an application containing an array that stores eight integers. Prompt the user to enter the 8 integers. The application should call five methods that in turn (1) display all the integers, (2) display all the integers in reverse order, (3) display the sum of the integers, (4) display all values less than the calculated average value, and (5) display all values that are higher than the calculated average value. Save the file as ArrayMethodDemo

Exercise #1: Cumulative sum: Write a Java program that prompts the user to enter an integer number (n) that indicates the number of elements of an array (the maximum value for n is 100). Then the user enters n double numbers. The program creates another array of cumulative sums of the first array and outputs it. One decimal place should be used to output the cumulative array. Sample inputs/outputs: Enter the array size: 4 Enter the array elements: 5.0 6.5 7.3 10.2 Cumulative Array: 5.0 11.5 18.8 29.0 Enter the array size: 101 The maximum size is 100! Enter the array size: 5 Enter the array elements: 2.34 5.61 4.67 0.897 Cumulative Array: 2.3 8.0 12.6 19.6 20.4

In this lab, you use what you have learned about searching an array to find an exact match to complete a partially prewritten Java program. The program uses an array that contains valid names for 10 cities in Michigan. You ask the user of the program to enter a city name; your program then searches the array for that city name. If it is not found, the program should print a message that informs the user the city name is not found in the list of valid cities in Michigan. The data file provided for this lab includes the input statements and the necessary variable declarations. You need to use a loop to examine all the items in the array and test for a match. You also need to set a flag if there is a match, and then test the flag variable to determine if you should print the "Not a city in Michigan" message. Comments in the code tell you where to write your statements. Study the prewritten code to make sure you understand it. Write a loop statement that examines the names of cities…

Programming Language: C++ You have been hired by Google to work on their YouTube videos search team.  Every YouTube video has a unique ID and those IDs are in unsorted order.  As a software engineer, you are required to make a YouTube search engine which works for very user.  Create a test engine that only holds seven YouTube IDs.  Prompt for and get from the user the seven IDs and store them in an integer array.  Then sort and print the array using the insertion sort algorithm.  Finally, use a sentinel loop to prompt for and get from the user a series of IDs.  For each ID, perform a binary search on the array and tell the user if it was found or not.  If found, print the index where the ID is stored.  Continue to prompt the user for an ID until entering the sentinel value of -999.   In addition to function main, define the following two functions:   void insertion_sort(int arr[], int arr_size)   int binary_search(int sort_arr[], int size_array, int search_value) binary_seacrh returns…

In this project you will generate a poker hand containing five cards randomly selected from a deck of cards. The names of the cards are stored in a text string will be converted into an array. The array will be randomly sorted to "shuffle" the deck.  Each time the user clicks a Deal button, the last five cards of the array will be removed, reducing the size of the deck size. When the size of the deck drops to zero, a new randomly sorted deck will be generated. A preview of the completed project with a randomly generated hand is shown in Figure 7-50.

Create a Console application that does the following:This program must use a single array to store integers and find the maximum value.1. Create an array and initialize it internally with the values 5, 8, 9, 4, and 2.2. Use a loop to iterate through the array and determine the maximum value.

strobogrammatic number is a number that looks the same when rotated 180 degrees (looked at upside down). Find all strobogrammatic numbers that are of length = n. For example, Given n = 2, return ["11","69","88","96"]. def gen_strobogrammatic(n): Given n, generate all strobogrammatic numbers of length n. :type n: int :rtype: List[str] return helper(n, n) def helper(n, length): if n == 0: return [™"] if n == 1: return ["1", "0", "8"] middles = helper(n-2, length) result = [] for middle in middles: if n != length: result.append("0" + middle + "0") result.append("8" + middle + "8") result.append("1" + middle + "1") result.append("9" + middle + "6") result.append("6" + middle + "9") return result def strobogrammatic_in_range(low, high): :type low: str :type high: str :rtype: int res = count = 0 low_len = len(low) high_len = len(high) for i in range(low_len, high_len + 1): res.extend(helper2(i, i)) for perm in res: if len(perm) == low_len and int(perm) int(high): continue count += 1 return…