Kim Gigabit purchase items of various quantities; valid quantities are greater than 0 and less than 100 Read the quantity for each 10 items from the keyboard and store each into an integer array; if Kim enters a quantity of 0, negative, or greater than 100, it should be rejected, and she should be queried for a valid entry After the valid entries are complete, display the unsorted array content, pass the unsorted array to another method for sorting, and display of the sorted array

Kim Gigabit purchase items of various quantities; valid quantities are greater than 0 and less than 100 Read the quantity for each 10 items from the keyboard and store each into an integer array; if Kim enters a quantity of 0, negative, or greater than 100, it should be rejected, and she should be queried for a valid entry After the valid entries are complete, display the unsorted array content, pass the unsorted array to another method for sorting, and display of the sorted array

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter12: Points, Classes, Virtual Functions And Abstract Classes

Section: Chapter Questions

Problem 29SA

See similar textbooks

Similar questions

Kim Gigabit purchase items of various quantities; valid quantities are greater than 0 and less than 100Read the quantity for each 10 items from the keyboard and store each into an integer array; if Kim enters a quantity of 0, negative, or greater than 100, it should be rejected, and she should be queried for a valid entry 1. After the valid entries are complete, display the unsorted array content, pass the unsorted array to another method for sorting, and display of the sorted array; you can use the code below for sorting 2. Modify the code below using the while loop /* * To change this license header, choose License Headers in Project Properties. * To change this template file, choose Tools | Templates * and open the template in the editor. */ package sortascending; public class Sortascending { public static void sortAsc( int[] arrayToSort ) { // Find the integer that should go in each cell j of // the arrayToSort, from cell 0 to the end for…
Suppoce we're given numpy arrays of names and scores, where each row in the scores array lists the midterm and final scores for that respective student. For example, Carol has a 75 on the midterm and 99 on the final. names = np. array([ "Alice" "Bob". "Carol","Derek ","Erin"]) Scores = np.array([ [95, 98], [82, 88], [75, 99], [80, 90], 85, 82 ]]) Write function avgMidtermNoC that takes ve parameters names and score arrays, and returns the average score on the midterm, exduding anyone who's name starta with C.
Using Kotlin Make up four students - add them into an array. Create a function for the class that checks if a given student name is in an array. Check if student (pick a name from your array) is in the array and print the result. Use the in operator. my code so far fun main() { // create 4 students var student1 = Student("JIm", 47, "3432") var student2 = Student("Bill", 35, "1222") var student3 = Student("Mary", 21, "58F5") var student4 = Student("Graham", 29, "8958") var students=arrayOf(student1, student2, student3, student4) for (student in students) { student.nameExists) } } class Student(var name: String, var age: Int, var classID: String){ fun nameExists() { if("Mary" in name) { println("Name is in the array") } } }
A football team plays a football game almost every month. It stores the number of goals scoredper month in an array of size 12. The number of goals scored on January is stored in the firstelement of the array (at index 0). The number of goals scored on February is stored in the 2ndelement of the array (at index 1) and so on.a. The team wants to find the month in which they scored the maximum number of goals.Write a function named String Max(int[] A) that takes the array of goals and returnsthe month name (a string value) in which they scored the maximum number of goals.b. The team wants to find the number of games played during the year. Note that if theteam didn’t play a game in a specific month, the value -1 is found. Write a function intNbGames(int[] A) to count the number of games played during the year.c. Write a program in which you create an array of size 12 having all its elementsinitialized to -1. Then ask the user to enter a month number and the number of goalsscored in that…
Problem 3: 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 the problem.
The code below computes the intersection (the number of entries shared by two arrays). It is assumed that neither array contains any duplicates. It computes the intersection by sorting one array (array b) and then iterating over array a to see if each value is in b (through binary search). What is its duration? nt intersection(int[] a, int[] b) {mergesort(b);}int intersect = 0;for (int x : a) {if (binarySearch(b, x) >= 0) {intersect++;return intersect; }}
4. Write a program to find kth smallest element in unsorted array?You are given an unsorted array of numbers and k, you need to find the kth smallest number in the array. Forexample if given array is {1, 2, 3, 9, 4} and k=2 then you need to find the 2nd smallest number in the array,which is 2.
Kim Gigabit purchase items of various quantities; valid quantities are greater than 0 and less than 100Read the quantity for each 10 items from the keyboard and store each into an integer array (use loop); if Kim enters a quantity of 0, negative, or greater than 100, it should be rejected, and she should be queried for a valid entry. After the valid entries are complete, display the unsorted array content, pass the unsorted array to another method for sorting (use for loop), and display of the sorted array. Use java
2. An interpolation search assumes that the data in an array is sorted and uniformly distributed.Whereas a binary search always looks at the middle item in an array, an interpolation searchlooks where the sought-for item is more likely to occur. For example, if you searched yourtelephone book for Victoria Appleseed, you probably would look near its beginning ratherthan its middle. And if you discovered many Appleseeds, you would look near the lastAppleseed. Instead of looking at the element a[mid] of an array a, as the binary search would,an interpolation search examines a[index], where p = (desiredElement - a[first]) / (a[last] - a[first]) index = first + [(last – first) × p]Implement an interpolation search of an array. For particular arrays, compare the outcomesof an interpolation search and of a binary search. Consider arrays that have uniformlydistributed entries and arrays that do not. Modify and save the file asSearchComparerYourlastname.java.
Given these two arrays, char arrA[] = {'a', 'e', 'i', 'o', 'u'} and char arrB[] = {'T', 'A', 'B','L','E'}, merge these two arrays into a new array. Make sure that the contents of arrA is interspersed with contents of arrB.
Ocaml 1. Create a function flip val flip : bool array array -> int -> int -> bool array array = <fun> that given a bool matrix and two integers i; j. it negates the values(true!false, false!true) at location i; j in the matrix, as well negatingthe values on the (up to) 4 horizontally/vertically adjacent elements. 2. Create a function print matrix val print_matrix : bool array array -> unit = <fun> that given a bool matrix, it prints it on screen (true !"T", false!"F").
Select true or false for the statements below. Explain your answers if you like to receive partial credit Select true or false for the statements below. Explain your answers if you like to receive partial credit Which of the following is true about searching elements in an unordered array? With the data is unsorted, search is O(n) because if the element you are looking for is not there, you have to check every element in the array If you start at the end of the array and traverse to index 0, search improves to O(log n) because you only have to look at half of the array If you get lucky with checking the first element and find it immediately, then the worst case performance of search improves to O(n^2) Which of the following is true about searching elements in an ordered array? You cannot use binary search on an ordered array so the performance is O(n) If there are no holes in the array and the elements are all next to each other, then the performance for search improves to…