Here we will create a method to find the smallest value in an array: We provided the code for you to start, Main is done, you need to create minFinder function, o First do it with loops Create another function minFinder_recursive, and use recursive function to create the code to find the min value (you may add more functions/methods as needed) Write the Pseudocode (https://en.wikipedia.org/wiki/Pseudocode) for BOTH functions and do a time analysis in Big-O for both (This step is really important) For the pseudocode, you do not need to be super detailed but in steps by steps tell us how your code works. The Sample Pseudocode will be shown in class oSubmit it in PDF. import java.util. Random; // this creates randon for our program public class App { public static int minfinder (int[] arr) { int index = 0; //YOUR CODE GOES HERE 17 you have to do two ways, once with loops, once with Recusive (For recursive you need more functions or methods, so create them) 7/once you find the minimum value, return the index of it in the array return index; } public static void main(String[] args) throws Exception [ int[] myArr = new int[180]; Random my Rand-new Random(); // creating Random object // Range for random to select from int min = 5; int max 1800; int indexmin=0; for (int i = 0; i < myArr.length; i++) { myArr[i] = myRand.nextInt(max-nin+1) + min; // storing randon integers in an array } // here we check the last item of array to see if it is full: System.out.println(myArr[ myArr.length-1]); // printing last element, not the biggest or smallest but just the last one //now we find the minimum calling the function you wrote: indexMin-minFinder (myArr); System.out.println("The minimum is at location: "+indexMin" The value is: "+nyArr[indexMin]);
Here we will create a method to find the smallest value in an array: We provided the code for you to start, Main is done, you need to create minFinder function, o First do it with loops Create another function minFinder_recursive, and use recursive function to create the code to find the min value (you may add more functions/methods as needed) Write the Pseudocode (https://en.wikipedia.org/wiki/Pseudocode) for BOTH functions and do a time analysis in Big-O for both (This step is really important) For the pseudocode, you do not need to be super detailed but in steps by steps tell us how your code works. The Sample Pseudocode will be shown in class oSubmit it in PDF. import java.util. Random; // this creates randon for our program public class App { public static int minfinder (int[] arr) { int index = 0; //YOUR CODE GOES HERE 17 you have to do two ways, once with loops, once with Recusive (For recursive you need more functions or methods, so create them) 7/once you find the minimum value, return the index of it in the array return index; } public static void main(String[] args) throws Exception [ int[] myArr = new int[180]; Random my Rand-new Random(); // creating Random object // Range for random to select from int min = 5; int max 1800; int indexmin=0; for (int i = 0; i < myArr.length; i++) { myArr[i] = myRand.nextInt(max-nin+1) + min; // storing randon integers in an array } // here we check the last item of array to see if it is full: System.out.println(myArr[ myArr.length-1]); // printing last element, not the biggest or smallest but just the last one //now we find the minimum calling the function you wrote: indexMin-minFinder (myArr); System.out.println("The minimum is at location: "+indexMin" The value is: "+nyArr[indexMin]);
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
100%
![Here we will create a method to find the smallest value in an array:
We provided the code for you to start,
Main is done, you need to create minFinder function,
o First do it with loops
Create another function minFinder_recursive, and use recursive function to create the code to
find the min value (you may add more functions/methods as needed)
Write the Pseudocode (https://en.wikipedia.org/wiki/Pseudocode) for BOTH functions and do
a time analysis in Big-O for both (This step is really important)
For the pseudocode, you do not need to be super detailed but in steps by steps tell us
how your code works.
The Sample Pseudocode will be shown in class
oSubmit it in PDF.
import java.util.Random; // this creates randon for our program
public class App {
public static int minfinder (int[] arr) {
int index = 0;
//YOUR CODE GOES HERE
1/ you have to do two ways, once with loops, once with Recusive (For recursive you need more functions or methods, so create them)
//once you find the minimum value, return the index of it in the array
return index;
}
public static void main(String[] args) throws Exception [
int[] myArr = new int[180];
Random myRand-new Random(); // creating Random object
// Range for random to select from
int min = 5;
int max 1000;
int indexMin-e;
for (int i = 0; i < myArr.length; i++) {
myArr[i] = my Rend.nextInt(max-nin+1) + min; // storing randon integers in an array
}
// here we check the last item of array to see if it is full:
System.out.println(myArr[ myArr.length-1]); // printing last element, not the biggest or smallest but just the last one
//now we find the minimum calling the function you wrote:
indexMin-minFinder (myArr);
System.out.println("The minimum is at location: "+indexMint" The value is: "+nyArr[indexMin]);](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F8e86230f-5cdf-4308-b446-8633bf74e33b%2F505a230c-00b7-46d7-9259-958a1aaf1d29%2Fbxbvazg_processed.png&w=3840&q=75)
Transcribed Image Text:Here we will create a method to find the smallest value in an array:
We provided the code for you to start,
Main is done, you need to create minFinder function,
o First do it with loops
Create another function minFinder_recursive, and use recursive function to create the code to
find the min value (you may add more functions/methods as needed)
Write the Pseudocode (https://en.wikipedia.org/wiki/Pseudocode) for BOTH functions and do
a time analysis in Big-O for both (This step is really important)
For the pseudocode, you do not need to be super detailed but in steps by steps tell us
how your code works.
The Sample Pseudocode will be shown in class
oSubmit it in PDF.
import java.util.Random; // this creates randon for our program
public class App {
public static int minfinder (int[] arr) {
int index = 0;
//YOUR CODE GOES HERE
1/ you have to do two ways, once with loops, once with Recusive (For recursive you need more functions or methods, so create them)
//once you find the minimum value, return the index of it in the array
return index;
}
public static void main(String[] args) throws Exception [
int[] myArr = new int[180];
Random myRand-new Random(); // creating Random object
// Range for random to select from
int min = 5;
int max 1000;
int indexMin-e;
for (int i = 0; i < myArr.length; i++) {
myArr[i] = my Rend.nextInt(max-nin+1) + min; // storing randon integers in an array
}
// here we check the last item of array to see if it is full:
System.out.println(myArr[ myArr.length-1]); // printing last element, not the biggest or smallest but just the last one
//now we find the minimum calling the function you wrote:
indexMin-minFinder (myArr);
System.out.println("The minimum is at location: "+indexMint" The value is: "+nyArr[indexMin]);
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 5 steps with 2 images
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY