Write a method to find top two maximum numbers in a given list. • You should not use any sorting functions. • You should iterate the array only once. • You should not use any kind of collections. • The supplied array will always have more than 2 elements def maxTwo(array): # Your code here return max1, max2

Write a method to find top two maximum numbers in a given list. • You should not use any sorting functions. • You should iterate the array only once. • You should not use any kind of collections. • The supplied array will always have more than 2 elements def maxTwo(array): # Your code here return max1, max2

Microsoft Visual C#

7th Edition

ISBN:9781337102100

Author:Joyce, Farrell.

Publisher:Joyce, Farrell.

Chapter6: Using Arrays

Section: Chapter Questions

Problem 19RQ

See similar textbooks

Similar questions

Modify the quick sort implementation in the textbook to sort the array using pivot as the median of the first, last, and middle elements of the array. Add the modified quick sort implementation to the arrayListType class provided (arrayListType.h). Ask the user to enter a list of positive integers ending with -999, sort the integers, and display the pivots for each iteration and the sorted array. Main Function #include <iostream>#include "arrayListType.h"using namespace std; int main(){ arrayListType<int> list;int num;cout << "Line 8: Enter numbers ending with -999" << endl;cin >> num; while (num != -999){list.insert(num);cin >> num;} cout << "Line 15: The list before sorting:" << endl;list.print();cout << endl; list.selectionSort();cout << "Line 19: The list after sorting:" << endl;list.print();cout << endl; return 0;} Header File (arrayList.h) Including images #include <iostream>#include <cassert>…
Project Description: In this project you implement an ArrayStack ADT and use the stack for implementing the following methods: a) Reverse an array of Words: Accept an array of words as input parameter and return an array of words in reverse order. Use the method signature: public static String[] reverse Words (String[] wordList) Example Input: Bird Cat Dog Elephant Output: Elephant Dog Cat Bird
Exercise 1: Write a program that generates a sequence of 20 random values between 0 and 99 in an array, prints the sequence, sorts it, and prints the sorted sequence. Use the sort method from the standard Java library. Exercise 2: Write a program that stores a list of countries: "Egypt", "Switzerland", "Argentina", "Spain", "Portugal", "Luxemburg", etc. Initialize your array with a single statement. Then print out the array. Use the sort function as before to sort the countries in alphabetical order. Reprint your array. Exercise 3: Implement exercises 1 and 2 using ArrayList. Use the Collections.sort method for sorting. After you have printed and sorted your results, then append an additional element to each list and reprint your ArrayLists. Notice that the new items will appear just at the end and will not be sorted. Resort and print out the new ArrayLists again. To clarify, you should print out your ArrayLists after your first sort, after adding items with the…
Complete the findMax() method that returns the largest value in array nums. Ex: If array nums contains: 2 4 6 8 10 7 5 3 the findMax() method returns: 10 Note: During development, array nums is filled with 10 pseudo-random integers in main() using the fillRandomly() method with a seed value of 7. When submitted, different seed values will be used to generate arrays of different size for the test cases. Refer to the textbook section on Random numbers to learn more about pseudo-random numbers. Code: import java.util.*;public class Numbers { private int[] nums; public int findMax() { /* Type your code here. */ } public void setNums(int[] nums) { this.nums = nums; } public int[] getNums() { return nums; } // Fill array nums with pseudo-random integers (0-999) with a seed value public void fillRandomly(int seed, int size) { Random rand = new Random(seed); nums = new int[size]; for(int i=0; i<nums.length; i++) { nums[i]…
1. You have an array of four integers that has been sorted from lowest to greatest value in the array. You also have a function that does a bubble sort in order to arrange things from lowest to greatest priority. If you call this method on your array, the function will perform at least one swap on your array. If false, why is it untrue?
Create an array of size 7 of integers1, -9, 10, 20, 5, 6, 7 . You can set these numbers in the code with initialization. (10 points)•Write a function that accepts anarray and returns the location/index of any value passed to the function. Test it with value 20 and value -1 (20 points) *HELP: this is linear search•Test it with value 7and write code in your “main” to see if it is the last element in the array
Write code that loops through the array myVals. Each iteration: If myVals[i] is less than smallestNum, assign smallestNum with myVals[i]. Remember to assign smallestNum with some value before the loop.
Create 2D array 4 *5. Ask the user to enter the number inside the array. Print the numbers organized by rows. Calculate the average for each row. Print the least average. Finally, create a method that receives a 2D array to print its elements reverse starting from the last element.
Create an array of size 7 of integers1, -9, 10, 20, 5, 6, 7 . You can set these numbers in the code with initialization. •Write a function that accepts anarray and returns the location/index of any value passed to the function. Test it with value 20 and value -1 *HELP: this is linear search•Test it with value 7 and write code in your “main” to see if it is the last element in the array
Write the following method that sorts an ArrayList of numbers:public static void sort(ArrayList<Integer> list)Write a test program that prompts the user to enter five numbers, stores them inan array list, and displays them in increasing order.
Suppose you are given a list of students registered in a course and you are required to implement an array-based student list. Each student in the list has name, regNo, department and cGpa. Implement different functions for entering the data (like constructor (for setting to default values), setName, setReg, etc.). You also need to implement the following function related to the array. insertStudent( ) : It has 2 options • Asking the user for index and then insert the student at that index AND • Asking the user for name of the student where the new student is to be added (New student should be added at the index of the student whose name is entered) o If the list is full, it should create a larger list (new size should be entered by the user), copy all the data in it and make insertion as instructed o (Insertion will only be made if the reg of the new student doesn’t exist in the list) deleteStudent( ): Same as insertStudent( ) (either by asking the index or student name) sort( ): Ask…
If N represents the number of elements in the collection, then the contains method of the ArrayCollection class is O(1). True or False If N represents the number of elements in the list, then the index-based add method of the ABList class is O(N). True or False