Question 1: The following algorithm takes an unsorted array of integer numbers as input and sorts it in descending order, by repeatedly doing the following: first, it searches in the whole array for the greatest element. it then puts this element to the beginning of the array. • then, it searches the whole array excluding the first element for the greatest value and puts it to the second position. Implement the algorithm according to two different strategies: A By using the method shiftRight(int] A, int i, int ): if the maximum element is found in position j and needs to be put into position i, then (1) shift A to the right, starting from position i, while remembering the element in position į that will be overridden; (i) copy the remembered element to position i B. By using the method swap(int] A, int i, int j): if the maximum element is found in position i and needs to be put into position j, then use swap to exchange the element in position i with the element in position j.
Question 1: The following algorithm takes an unsorted array of integer numbers as input and sorts it in descending order, by repeatedly doing the following: first, it searches in the whole array for the greatest element. it then puts this element to the beginning of the array. • then, it searches the whole array excluding the first element for the greatest value and puts it to the second position. Implement the algorithm according to two different strategies: A By using the method shiftRight(int] A, int i, int ): if the maximum element is found in position j and needs to be put into position i, then (1) shift A to the right, starting from position i, while remembering the element in position į that will be overridden; (i) copy the remembered element to position i B. By using the method swap(int] A, int i, int j): if the maximum element is found in position i and needs to be put into position j, then use swap to exchange the element in position i with the element in position j.
Programming Logic & Design Comprehensive
9th Edition
ISBN:9781337669405
Author:FARRELL
Publisher:FARRELL
Chapter6: Arrays
Section: Chapter Questions
Problem 17RQ
Related questions
Question
the qusetion on the picture
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 1 images
Recommended textbooks for you
Programming Logic & Design Comprehensive
Computer Science
ISBN:
9781337669405
Author:
FARRELL
Publisher:
Cengage
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning
Programming Logic & Design Comprehensive
Computer Science
ISBN:
9781337669405
Author:
FARRELL
Publisher:
Cengage
C++ Programming: From Problem Analysis to Program…
Computer Science
ISBN:
9781337102087
Author:
D. S. Malik
Publisher:
Cengage Learning