Data Structures and Algorithms in Java
6th Edition
ISBN: 9781118771334
Author: Michael T. Goodrich
Publisher: WILEY
expand_more
expand_more
format_list_bulleted
Concept explainers
Expert Solution & Answer
Chapter 4, Problem 36C
Explanation of Solution
Efficient
//Create a class
public class Integers
{
The main() function stores number of integers in an array and then use the for loop to determine the first ten largest numbers in an array.
//Main function definition
public static void main (String[]args)
{
//Declare the array of integers
int[] x= new int[]{3,4,5,6,7,8,9,10,11,2,12,13,14,15,16};
//Execute the condition until the length is 9
if(x.length>9)
{
/*Execute the for loop until it ends with the array of integers*/
for(int i=1;i<x...
Explanation of Solution
Explanation:
- Create a class and then declare the main() function.
- Declare the required variable and assign the integer array with values.
- Use if condition to execute until the length of array.
- Use the outer for loop to execute until it includes all the elements in the array.
- Use the inner for loop to determine the ten largest numbers in an array by swapping the values.
- Then use for loop to print the ten largest numbers from an array.
Running time of algorithm:
In the above algorithm, it uses three for loop...
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Design an algorithm to rearrange elements of a given array of n real numbers so that all its negative elements precede all its positive elements. Your algorithm should be both time efficient and space efficient.
Given an array A of integer type of length n (n > 7), write a pseudocode of an efficient algorithm for finding the seven smallest elements in A. What is the running time of your algorithm?
16. Given an n-element array with n > 100, is it possible to find an algorithm that can
find an element that is neither the maximum nor the minimum with fewer than 10
comparisons?
(a)
yes
(b) no
Chapter 4 Solutions
Data Structures and Algorithms in Java
Ch. 4 - Prob. 1RCh. 4 - The number of operations executed by algorithms A...Ch. 4 - The number of operations executed by algorithms A...Ch. 4 - Prob. 4RCh. 4 - Prob. 5RCh. 4 - Prob. 6RCh. 4 - Prob. 7RCh. 4 - Prob. 8RCh. 4 - Prob. 9RCh. 4 - Prob. 10R
Ch. 4 - Prob. 11RCh. 4 - Prob. 12RCh. 4 - Prob. 13RCh. 4 - Prob. 14RCh. 4 - Prob. 15RCh. 4 - Prob. 16RCh. 4 - Prob. 17RCh. 4 - Prob. 18RCh. 4 - Prob. 19RCh. 4 - Prob. 20RCh. 4 - Prob. 21RCh. 4 - Prob. 22RCh. 4 - Show that 2n+1 is O(2n).Ch. 4 - Prob. 24RCh. 4 - Prob. 25RCh. 4 - Prob. 26RCh. 4 - Prob. 27RCh. 4 - Prob. 28RCh. 4 - Prob. 29RCh. 4 - Prob. 30RCh. 4 - Prob. 31RCh. 4 - Prob. 32RCh. 4 - Prob. 33RCh. 4 - Prob. 34RCh. 4 - Prob. 35CCh. 4 - Prob. 36CCh. 4 - Prob. 37CCh. 4 - Prob. 38CCh. 4 - Prob. 39CCh. 4 - Prob. 40CCh. 4 - Prob. 41CCh. 4 - Prob. 42CCh. 4 - Prob. 43CCh. 4 - Draw a visual justification of Proposition 4.3...Ch. 4 - Prob. 45CCh. 4 - Prob. 46CCh. 4 - Communication security is extremely important in...Ch. 4 - Al says he can prove that all sheep in a flock are...Ch. 4 - Consider the following justification that the...Ch. 4 - Consider the Fibonacci function, F(n) (see...Ch. 4 - Prob. 51CCh. 4 - Prob. 52CCh. 4 - Prob. 53CCh. 4 - Prob. 54CCh. 4 - An evil king has n bottles of wine, and a spy has...Ch. 4 - Prob. 56CCh. 4 - Prob. 57CCh. 4 - Prob. 58CCh. 4 - Prob. 59CCh. 4 - Prob. 60PCh. 4 - Prob. 61PCh. 4 - Perform an experimental analysis to test the...Ch. 4 - Prob. 63P
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- Sort an array of 10 elements in asscending order by writing up an algorithm with proper notations.arrow_forwardWrite an algorithm to find the maximum in an arrayarrow_forwardAn array A contains n - 1 unique integers in the range [0, n - 11; that is, there is one number from this range that is not in A. Design an O(n)- time algorithm (write a pseudo-code, Python function or Java method) for finding that number. You can use only 0(1) additional space beside array A.arrow_forward
- Computer Science problem on Algorithmsarrow_forwardWrite Java Program to Sort an array of element by getting values from user Remove duplicate elements from a sorted array Reverse the contents inside an array Search for an element inside the array using linear searcharrow_forwardDesign a divide-and-conquer algorithm to compute the second largest element in an array on n elements. You should present your algorithm recursively and should give a time complexity analysis using recurrences.arrow_forward
- Check if Array Elements are Consecutive. Given an array, we need to check if array contains consecutive elements in Python.arrow_forwardWrite a program to find tha largest element in tha array using recursion .arrow_forwardWrite an algorithm in steps to check if an array of integers contains two specified elements 35 and 99.arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education