Connecting Tech Pros Worldwide Help | Site Map

Too much Java to memorize

Newbie
 
Join Date: Oct 2006
Location: Minnesota
Posts: 1
#1: Oct 19 '06
I am behind in my IB Comp Sci class and we are dealing with java and easyish problems. I am working on 5 problems now, and the 2 i have to do is due monday the 23rd. the instructions are:

1. Create an integer array holding 100 values
2. Create 100 different random integer numbers and place these into the array
3. Using a selection sort, sort the array from least to greatest
a. process for a selection sort
b. frind the minimum value on the list
c. swap it with the value in the frist position
d. sort the remainder of the list (excluding the first value)
1. hint: use two for loops, set the firrst loop equal to the 0 index, set the index value of the second loop to the index +1 of the first loop.
2. hint: have the frist loop onlu pass through the array until it reaches the second to the last spot in the array
e. print the output of the sorted array at the end of the code

Any one got any good codes? They could really help. Please contact me at andrew.viper1616@gmail.com. I have attemped the problem myself so many times, and i alway get like 50 billion errors (added up to what i already fixed) Thank you. And please dont post a reply and just email me.
Familiar Sight
 
Join Date: Sep 2006
Posts: 144
#2: Oct 19 '06

re: Too much Java to memorize


Maybe you should post your problem code. That way people can walk you through the problems spots and then maybe you might learn something.
Lives Here
 
Join Date: Sep 2006
Posts: 12,070
#3: Oct 19 '06

re: Too much Java to memorize


Quote:

Originally Posted by Viper1616

I am behind in my IB Comp Sci class and we are dealing with java and easyish problems. I am working on 5 problems now, and the 2 i have to do is due monday the 23rd. the instructions are:

1. Create an integer array holding 100 values
2. Create 100 different random integer numbers and place these into the array
3. Using a selection sort, sort the array from least to greatest
a. process for a selection sort
b. frind the minimum value on the list
c. swap it with the value in the frist position
d. sort the remainder of the list (excluding the first value)
1. hint: use two for loops, set the firrst loop equal to the 0 index, set the index value of the second loop to the index +1 of the first loop.
2. hint: have the frist loop onlu pass through the array until it reaches the second to the last spot in the array
e. print the output of the sorted array at the end of the code

Any one got any good codes? They could really help. Please contact me at andrew.viper1616@gmail.com. I have attemped the problem myself so many times, and i alway get like 50 billion errors (added up to what i already fixed) Thank you. And please dont post a reply and just email me.

I suppose people view this site differently
Reply