Calling Java Experts - Help Please

[bokuboy]

One of my friend asked this...Java experts can u help him

[color=#282828][font=helvetica, arial, sans-serif]Mamalu nah school la eh problem eccharu .. KOnchem help cheyandri[/font][/color]

[color=#282828][font=helvetica, arial, sans-serif]Write a program that will sort three integers. The integers are entered from the input dialogs and stored in variables num1, num2, and num3, respectively. The program sorts the numbers so that num1<=num2<=num3.[/font][/color]
[color=#282828][font=helvetica, arial, sans-serif]*** Please submit the source code, byte code and the explanation of your source code design[/font][/color]

[color=#282828][font=helvetica, arial, sans-serif]Answer eh link lo dorikindhi :[/font][/color][url="http://www.justanswer.com/computer-programming/1r50q-write-java-program-will-read-integers-find-total.html"]http://www.justanswe...find-total.html[/url]

[color=#282828][font=helvetica, arial, sans-serif]Konchem source code; Byte code ; Explanation of source code design seppi punyam katukondi mamalu[/font][/color]

[color=#282828][font=helvetica, arial, sans-serif] [/font][/color][color=#282828][font=helvetica, arial, sans-serif] [/font][/color] [color=#282828][font=helvetica, arial, sans-serif] [/font][/color]

[Terminator II]

afdb roju roju ki develope avuthodayya.. btech problems kuda post chesthunnaru..

[ChampakDas]

[color=#282828][font=helvetica, arial, sans-serif]Byte code gurinchi worry em avasaram ledhu...you can generate bytecode from the main .java file like this [/font][/color]

javac Sorting.java
javap -c Sorting > Sorting.bc

[cherlapalli_jailer]

you want explanation of the sample code?

[cherlapalli_jailer]

[size=4]use this method

[color=#7F0055][font=monospace][b]public static [/b][/font][/color][color=#7F0055][font=monospace][b]void [/b][/font][/color][color=#000000][color=#000000][font=monospace]sort[/font][/color][/color][color=#000000][color=#000000][font=monospace]([/font][/color][/color][color=#7F0055][font=monospace][b]double[/b][/font][/color][color=#000000][color=#000000][font=monospace][] [/font][/color][/color][color=#000000][color=#000000][font=monospace]nums[/font][/color][/color][color=#000000][color=#000000][font=monospace]) {[/font][/color][/color]
[color=#3F7F5F][font=monospace]// Loop through each element of the array, sorting as we go.[/font][/color]
[color=#3F7F5F][font=monospace]// Each time through, find the smallest remaining element, and move it[/font][/color]
[color=#3F7F5F][font=monospace]// to the first unsorted position in the array.[/font][/color]
[color=#7F0055][font=monospace][b]for [/b][/font][/color][color=#000000][color=#000000][font=monospace]([/font][/color][/color][color=#7F0055][font=monospace][b]int [/b][/font][/color][color=#000000][color=#000000][font=monospace]i = [/font][/color][/color][color=#990000][font=monospace]0[/font][/color][color=#000000][color=#000000][font=monospace]; i < nums.length; i++[/font][/color][/color][color=#000000][color=#000000][font=monospace]) {[/font][/color][/color]
[color=#FFFFFF][font=monospace] [/font][/color][color=#7F0055][font=monospace][b]int [/b][/font][/color][color=#000000][color=#000000][font=monospace]min = i; [/font][/color][/color][color=#3F7F5F][font=monospace]// holds the index of the smallest element[/font][/color]
[color=#FFFFFF][font=monospace] [/font][/color][color=#3F7F5F][font=monospace]// find the smallest one between i and the end of the array[/font][/color]
[color=#FFFFFF][font=monospace] [/font][/color][color=#7F0055][font=monospace][b]for [/b][/font][/color][color=#000000][color=#000000][font=monospace]([/font][/color][/color][color=#7F0055][font=monospace][b]int [/b][/font][/color][color=#000000][color=#000000][font=monospace]j = i; j < nums.length; j++[/font][/color][/color][color=#000000][color=#000000][font=monospace]) {[/font][/color][/color]
[color=#7F0055][font=monospace][b]if [/b][/font][/color][color=#000000][color=#000000][font=monospace]([/font][/color][/color][color=#000000][color=#000000][font=monospace]nums[/font][/color][/color][color=#000000][color=#000000][font=monospace][[/font][/color][/color][color=#000000][color=#000000][font=monospace]j[/font][/color][/color][color=#000000][color=#000000][font=monospace]] [/font][/color][/color][color=#000000][color=#000000][font=monospace]< nums[/font][/color][/color][color=#000000][color=#000000][font=monospace][[/font][/color][/color][color=#000000][color=#000000][font=monospace]min[/font][/color][/color][color=#000000][color=#000000][font=monospace]])[/font][/color][/color]
[color=#FFFFFF][font=monospace] [/font][/color][color=#000000][color=#000000][font=monospace]min = j;[/font][/color][/color]
[color=#FFFFFF][font=monospace] [/font][/color][color=#000000][color=#000000][font=monospace]}[/font][/color][/color]
[color=#FFFFFF][font=monospace] [/font][/color][color=#3F7F5F][font=monospace]// Now swap the smallest one with element i.[/font][/color]
[color=#FFFFFF][font=monospace] [/font][/color][color=#3F7F5F][font=monospace]// This leaves all elements between 0 and i sorted.[/font][/color]
[color=#FFFFFF][font=monospace] [/font][/color][color=#7F0055][font=monospace][b]double [/b][/font][/color][color=#000000][color=#000000][font=monospace]tmp;[/font][/color][/color]
[color=#FFFFFF][font=monospace] [/font][/color][color=#000000][color=#000000][font=monospace]tmp = nums[/font][/color][/color][color=#000000][color=#000000][font=monospace][[/font][/color][/color][color=#000000][color=#000000][font=monospace]i[/font][/color][/color][color=#000000][color=#000000][font=monospace]][/font][/color][/color][color=#000000][color=#000000][font=monospace];[/font][/color][/color]
[color=#FFFFFF][font=monospace] [/font][/color][color=#000000][color=#000000][font=monospace]nums[/font][/color][/color][color=#000000][color=#000000][font=monospace][[/font][/color][/color][color=#000000][color=#000000][font=monospace]i[/font][/color][/color][color=#000000][color=#000000][font=monospace]] [/font][/color][/color][color=#000000][color=#000000][font=monospace]= nums[/font][/color][/color][color=#000000][color=#000000][font=monospace][[/font][/color][/color][color=#000000][color=#000000][font=monospace]min[/font][/color][/color][color=#000000][color=#000000][font=monospace]][/font][/color][/color][color=#000000][color=#000000][font=monospace];[/font][/color][/color]
[color=#FFFFFF][font=monospace] [/font][/color][color=#000000][color=#000000][font=monospace]nums[/font][/color][/color][color=#000000][color=#000000][font=monospace][[/font][/color][/color][color=#000000][color=#000000][font=monospace]min[/font][/color][/color][color=#000000][color=#000000][font=monospace]] [/font][/color][/color][color=#000000][color=#000000][font=monospace]= tmp;[/font][/color][/color]

[color=#000000][color=#000000][font=monospace] [/font][/color][/color][color=#7F0055][font=monospace][b]for [/b][/font][/color][color=#000000][color=#000000][font=monospace]([/font][/color][/color][color=#7F0055][font=monospace][b]int k[/b][/font][/color][color=#000000][color=#000000][font=monospace] = [/font][/color][/color][color=#990000][font=monospace]0[/font][/color][color=#000000][color=#000000][font=monospace]; k < nums.length; k++[/font][/color][/color][color=#000000][color=#000000][font=monospace])[/font][/color][/color]
[color=#FFFFFF][font=monospace] [/font][/color][color=#3F7F5F][font=monospace]// Print them out[/font][/color]
[color=#FFFFFF][font=monospace] [/font][/color][color=#000000][color=#000000][font=monospace]System.out.println[/font][/color][/color][color=#000000][color=#000000][font=monospace]([/font][/color][/color][color=#000000][color=#000000][font=monospace]nums[/font][/color][/color][color=#000000][color=#000000][font=monospace][k[/font][/color][/color][color=#000000][color=#000000][font=monospace]])[/font][/color][/color][color=#000000][color=#000000][font=monospace];[/font][/color][/color]
[color=#FFFFFF][font=monospace] [/font][/color][color=#000000][color=#000000][font=monospace]}[/font][/color][/color]
[color=#000000][color=#000000][font=monospace]}[/font][/color][/color]
[color=#FFFFFF][font=monospace] [/font][/color][color=#000000][color=#000000][font=monospace]}[/font][/color][/color][/size]

[innovative]

Already rasina code explain cheyyala ..

pyna charlapalli_jailer rasina code lo with explanation vundhi .. gp

[innovative]

[quote name='GatisKandis' timestamp='1353341243' post='1302822893']
[color=#282828][font=helvetica, arial, sans-serif]Byte code gurinchi worry em avasaram ledhu...you can generate bytecode from the main .java file like this [/font][/color]

javac Sorting.java
javap -c Sorting > Sorting.bc
[/quote]

[kiran karthik]

we can get the i/ps from console by using scanner class

Scanner scanner=new Scanner(System.in);
String s1=scanner.nextLine();
int a1=Integer.parseInt(s1);

the sorting techniques are same

[kiran karthik]

array elements ga theesukunte
array.sort() method use cheste sari very simple