Name: Anonymous 2011-10-17 0:03
Hey guys I need help with my java coding. I'm required to write a code that takes 3 numbers (user input) and sort them from smallest to largest. Can someone show me how to code this?
import java.util.Scanner;
public class anus
{
static Scanner s = new Scanner(System.in);
public static void main(String args[])
{
int[] a = { getInt() },
b = { getInt() },
c = { getInt() };
if(b[0] > a[0])
swap(a,b);
if(c[0] > a[0])
if(c[0] > b[0]){
swap(a,c);
if(c[0] > b[0])
swap(b,c);
}
else
swap(b,c);
System.out.printf("[%d][%d][%d]%n",a[0],b[0],c[0]);
}
public static int getInt()
{
System.out.printf("Enter a integer: ");
return s.nextInt();
}
public static void swap(int[] a,int[] b)
{
a[0] ^= b[0];
b[0] ^= a[0];
a[0] ^= b[0];
}
}
import java.util.Scanner;
public class anus
{
static Scanner s = new Scanner(System.in);
public static void main(String args[])
{
int[] a = { getInt() },
b = { getInt() },
c = { getInt() };
swap(a,max(a,b,c));
swap(b,max(b,c));
System.out.printf("[%d][%d][%d]%n",a[0],b[0],c[0]);
}
public static int[] max(int[] a,int[] b,int[] c)
{
return (b[0] > a[0] && b[0] > c[0]) ? b : (c[0] > a[0] && c[0] > b[0]) ? c : a;
}
public static int[] max(int[] a,int[] b)
{
return (b[0] > a[0]) ? b : a;
}
public static int getInt()
{
System.out.printf("Enter a integer: ");
return s.nextInt();
}
public static void swap(int[] a,int[] b)
{
if(a != b){
a[0] ^= b[0];
b[0] ^= a[0];
a[0] ^= b[0];
}
}
}
import java.util.Iterator;
import java.util.List;
import java.util.ArrayList;
public class ListExample {
public static void main(String[] args) {
// List Example implement with ArrayList
List<String> ls=new ArrayList<String>();
static Scanner s = new Scanner(System.in);
ls.add(s.nextInt());
ls.add(s.nextInt());
ls.add(s.nextInt());
Collections.sort(ls, Collections.reverseOrder());
Iterator it=ls.iterator();
while(it.hasNext())
{
String value=(String)it.next();
System.out.println("SUBENTERPRISE QUALITY :"+value);
}
}
}
public class RetardSort
{
public int num1;
public int num3;
public int num2;
public void sortIt()
{
if (num1 < num2 && num1 < num3)
{
System.out.println(num1);
System.out.println(num2);
System.out.println(num3);
}
else if (num2 < num1 && num2 < num3)
{
System.out.println(num2);
System.out.println(num3);
System.out.println(num1);
}
else if (num3 < num1 && num3 < num2)
{
System.out.println(num3);
System.out.println(num1);
System.out.println(num2);
}
}
}
import java.util.Scanner;
public class Itbegins
{
public static void main(String[]args)
{
Scanner keyboard = new Scanner(System.in);
System.out.println("Please enter your 3 numbers:");
int num1Input = keyboard.nextInt();
int num2Input = keyboard.nextInt();
int num3Input = keyboard.nextInt();
RetardSort numberOne;
numberOne = new RetardSort();
numberOne.num1 = num1Input;
numberOne.num2 = num2Input;
numberOne.num3 = num3Input;
numberOne.sortIt();
}
}
(letrec ((num1 (read))
(num2 (read))
(num3 (read))
(reduce-left (lambda (lis op id)
(if (null? lis)
id
(reduce (cdr lis) op (op id (car lis))))))
(reduce-passes (lambda (lis op)
(letrec ((reduce-one-step (lambda (lis-position reduction-lis)
(if (null? lis-position)
(reverse reduction-lis)
(if (null? (cdr lis-position))
(reverse (cons (car lis-position) reduction-lis))
(reduce-one-step (cddr lis-position)
(cons (op (car lis-position) (cadr lis-position))
reduction-lis))))))
(reduce-all (lambda (current-lis)
(if (null? (cdr current-lis)) ;; Is the length 1?
(car current-lis)
(reduce-all (reduce-one-step current-lis '()))))))
(reduce-all lis))))
(make-merger (lambda (compare)
(lambda (lis1 lis2)
(letrec ((merge (lambda (lis1 lis2 accumulation)
(let ((push-lis1 (lambda () (merge (cdr lis1) lis2 (cons (car lis1) accumulation))))
(push-lis2 (lambda () (merge lis1 (cdr lis2) (cons (car lis2) accumulation)))))
(if (null? lis1)
(if (null? lis2)
(reverse accumulation)
(push-lis2))
(if (null? lis2)
(push-lis1)
(if (compare (car lis1) (car lis2))
(push-lis1)
(push-lis2))))))))
(merge lis1 lis2 '())))))
(merge-sort (lambda (lis compare)
(reduce-passes (map list lis) (make-merger compare)))))
(display (merge-sort (list num1 num2 num3) <)))
/**
* This class sorts three numbers.
* Standard Input: 3 integers separated by newline character.
* Sample usage:
* java SortThreeNumbers.java
* 1021
* 377
* 800
*/
public class SortThreeNumbers {
public SortThreeNumbers(int a, int b, int c) {
int x=(a<=b&&a<=c)?a:(b<=a&&b<=c)?b:c,y=(a>=b&&a>=c)?a:(b>=a&&b>=c)?b:c,z=(x!=a&&y!=a)?a:(x!=b&&y!=b)?b:c;
System.out.println(x+" "+z+" "+y);
}
public static void main(String[] a) throws java.io.IOException {
java.io.BufferedReader b = new java.io.BufferedReader(new java.io.InputStreamReader(System.in));
new SortThreeNumbers(Integer.parseInt(b.readLine()),Integer.parseInt(b.readLine()),Integer.parseInt(b.readLine()));
}
}java SortThreeNumbers instead of java SortThreeNumbers.java
start :-
purorogu2jabba(realmain,[
(pantsu(A,B,A2,B2) :- A<B -> (A2=A,B2=B); (A2=B, B2=A)),
(haskal(A,B,C,A2,B2,C2) :-
pantsu(A,B,Z1,Z2),
pantsu(Z2,C,Z3,Z4),
pantsu(Z1,Z3,A2,B2), C2=Z4),
(realmain(_Nothing) :-
input_line_to_number(A),
input_line_to_number(B),
input_line_to_number(C),
haskal(A,B,C,A2,B2,C2),
output_number_to_line(A2),
output_number_to_line(B2),
output_number_to_line(C2)
)
]).
purorogu2jabba(MainF,IC) :-
format("import java.io.*;~n",[]),
format("public class Touhou~n",[]),
format("{~n",[]),
format("public static class EntVar~n",[]),
format("{~npublic int value = -1;~n}~n",[]),
format("public static void main(String[] args)~n",[]),
format("{~n(new Touhou()).~w(new EntVar());~n}~n",[MainF]),
purorogu2jabba_ic(IC),
format("}~n",[]).
purorogu2jabba_ic([]) :- !.
purorogu2jabba_ic([(Head :- Body)|P2]) :-
Head =.. [Name|Args],
purorogu2jabba_al(Args,AT),
format("public void ~w (~s)~n",[Name,AT]),
format("{~n",[]),
on1(Body,Args,Z,[],AA),
varlchku(AA,BB),
list_to_set(BB,CC),
purorogu2jabba_dc(CC),
format("~w",[Z]),
format(";~n}~n",[]),
purorogu2jabba_ic(P2).
purorogu2jabba_al([A],C) :- format(string(C),"EntVar obj~w",[A]).
purorogu2jabba_al([A|B],C) :- purorogu2jabba_al(B,D),format(string(C),"EntVar obj~w, ~s",[A,D]).
purorogu2jabba_dc([]) :- !.
purorogu2jabba_dc([V|VL]) :- format("EntVar ~w = new EntVar();~n",[V]),purorogu2jabba_dc(VL).
purorogu2jabba_fa([A],C,V,W,W) :- varlchk(A,V), format(string(C),"obj~w",[A]).
purorogu2jabba_fa([A|B],C,V,W,WN) :- varlchk(A,V), purorogu2jabba_fa(B,D,V,W,WN),format(string(C),"obj~w, ~s",[A,D]).
purorogu2jabba_fa([A],C,V,W,[A|W]) :- \+ varlchk(A,V), format(string(C),"obj~w",[A]).
purorogu2jabba_fa([A|B],C,V,W,WN) :- \+ varlchk(A,V),W2=[A|W],purorogu2jabba_fa(B,D,V,W2,WN),format(string(C),"obj~w, ~s",[A,D]).
varlchku([],[]).
varlchku([A|B],[C|D]) :- format(string(C), "obj~w",[A]), varlchku(B,D).
varlchk(A,V) :- varlchku(V,VS), format(string(AT), "obj~w",[A]), member(AT,VS).
on1(Y,V,Z,W,WN) :- nonvar(Y), Y = input_line_to_number(A), on1(A,V,AN,W,WN),
format(string(Z1),"try { ~w = Integer.parseInt(new BufferedReader(new BufferedReader(",[AN]),
format(string(Z2),"new InputStreamReader(System.in))).readLine());}catch(IOException e){}",[]),
format(string(Z),"~s~s",[Z1,Z2]).
on1(Y,V,Z,W,WN) :- nonvar(Y), Y = output_number_to_line(A), on1(A,V,AN,W,WN),
format(string(Z),"System.out.println(~w)",[AN]).
on1(A,V,Z,W,W) :- var(A), varlchk(A,V), format(string(Z),"obj~w.value",[A]).
on1(A,V,Z,W,[A|W]) :- var(A), \+ varlchk(A,V), format(string(Z),"obj~w.value",[A]).
on1(Y,V,Z,W,WN) :- nonvar(Y), compound(Y), Y =.. [FC|Args],
\+ member(FC,[',','=','->',';','<',input_line_to_number,output_number_to_line]),
purorogu2jabba_fa(Args,AT,V,W,WN), format(string(Z),"~w(~s)",[FC,AT]).
on1(Y,V,Z,W,WN) :- nonvar(Y), Y = (A < B), on1(A,V,AN,W,W2),on1(B,V,BN,W2,WN),format(string(Z),"~w < ~w",[AN,BN]).
on1(Y,V,Z,W,WN) :- nonvar(Y), Y = (A , B), on1(A,V,AN,W,W2),on1(B,V,BN,W2,WN),format(string(Z),"~w;~n~w",[AN,BN]).
on1(Y,V,Z,W,WN) :- nonvar(Y), Y = (A = B), on1(A,V,AN,W,W2),on1(B,V,BN,W2,WN),format(string(Z),"~w = ~w",[AN,BN]).
on1(Y,V,Z,W,WN) :- nonvar(Y), Y = (C -> D1 ; D2),
on1(C,V,CN,W,W2),
on1(D1,V,D1N,W2,W3),
on1(D2,V,D2N,W3,WN),
format(string(Z), "if (~w)~n{~n~w;~n}~nelse~n{~n~w;~n}",[CN,D1N,D2N]).(define sort3
(lambda (a b c)
(cond ((and (<= a b) (<= b c)) (list a b c))
((and (<= a c) (<= c b)) (list a c b))
((and (<= b a) (<= a c)) (list b a c))
((and (<= b c) (<= c a)) (list b c a))
((and (<= c a) (<= a b)) (list c a b))
((and (<= c b) (<= b a)) (list c b a)))))
(define run
(letrec ((n1 (read))
(n2 (read))
(n3 (read))
(r (sort3 n1 n2 n3)))
(map (lambda (x) (print x) (newline)) r)))
/*
* Sorter.java
*/
import java.util.Scanner;
public class Sorter
{ private class Cons
{ public int car;
public Cons cdr;
public Cons(int a, Cons b)
{ this.car = a;
this.cdr = b; } }
private Cons cons(int a, Cons b)
{ return new Cons(a, b); }
private int car(Cons x)
{ return x.car; }
private Cons cdr(Cons x)
{ return x.cdr; }
private Cons nil;
private void run()
{ Scanner input = new Scanner(System.in);
int x = input.nextInt();
int y = input.nextInt();
int z = input.nextInt();
Cons l = (cons (x, (cons (y, (cons (z, nil))))));
Cons res = (sort (l));
System.out.print("(");
for (Cons c = res; c != nil; c = cdr(c))
System.out.print(car(c) + " ");
System.out.println(")"); }
private Cons sort(Cons list)
{ if (list != nil)
{ if (cdr (list) != nil)
{ if ((car (list)) < (car (cdr (list))))
return (cons (car (list), (sort (cdr (list)))));
else
return (cons (car (cdr (list)),
(sort (cons (car (list), (cdr (cdr (list)))))))); }
else
return list; }
else
return nil; }
public static void main(String[] args)
{ new Sorter().run(); } }
<= can take more than two arguments.(cond ((<= a b c) (list a b c))
((<= a c b) (list a c b))
...)
(<= a b c) (list a b c) boilerplate away:(define f (lambda (a b c) (and (<= a b c) (list a b c))))
(define sort3
(lambda (a b c)
(cond ((f a b c)) ((f a c b)) ...)))
...(cond (true-condition)) being equivalent to (cond (true-condition => values)).