Skip to main content

Two Dimensional Array Sorting: By User Selected Column

SORTING A TWO DIMENSIONAL ARRAY COLUMN WISE



AIM:   Take a Two Dimensional array. Each row corresponds to a student and columns correspondingly represents the Roll Number.
Marks in English ,Marks in Math and Marks in Hindi. Take all the inputs from the user. Provide a choice to the user of sorting this two dimensional array on the basis of any of the four columns, i.e., sorting can be done on Roll. no. or any of the three marks.In case more than  one student has scored same marks then the lashing is resolved using Roll. no.

 For Example:
Input:                     By Column 1:        By Column 2:
2 50 60 40               1 50 40 30               4 20 60 60
1 50 40 30               2 50 60 40               3 40 50 40 
4 20 60 60               3 40 50 40               1 50 40 30
3 40 50 40               4 20 60 60               2 50 60 40

 CODE:

Labels:

Comments

Post a Comment

Popular posts from this blog

Disarium Number

AJ Java Programs Program 4: Disarium Number A number will be called DISARIUM if sum of its digits powered with their respective position is equal to the original number. For example  135 is a DISARIUM (Workings 1 1 +3 2 +5 3  = 135, some other  DISARIUM  are 89, 175, 518 etc) Syntax: import java.io.*; class disarium {     public static void main(String args[])throws IOException     {         BufferedReader br=new BufferedReader(new InputStreamReader(System.in));         int n,n1,n2,c=0,sum=0,d=0;         System.out.println("Enter a Num");         n=Integer.parseInt(br.readLine());         n2=n1=n;         while(n2!=0)         {             n2=n2/10;             c++;         }       ...
28 comments
Read more

MAGICAL/ MAGIC NUMBER USING RECURSION

PROGRAM :  MAGICAL NUMBER BY RECURSION This  program  checks if a  number  is a  Magic number  in  JAVA . A  number  is said to be a  Magic number  if the sum of its digits are calculated till a single digit is obtained by recursively adding the sum of its digits. If the single digit comes to be 1 then the  number  is a  magic number . Example: 10999 => 1+0+9+9+9=28=>2+8=>10=>1+0= 1                  199    =>1+9+9 =>19=> 1+9=>10=>1+0= 1 SYNTAX import java.io.*; class magic  {    static int c;     public static void main(String arsg[])throws IOException     {         BufferedReader br=new BufferedReader(new InputStreamReader(System.in));         int n;int d=0;int m;         System.out.println("ENter a NUmber");   ...
3 comments
Read more

SMITH NUMBER

PROGRAM: SMITH NUMBER A   Smith number  is a composite number, the sum of whose digits is the sum of the digits of its prime factors obtained as a result of prime factorization (excluding 1). The first few such numbers are 4, 22, 58, 85, 94, 121 ……………….. For Example 58=> 5+8=13 2+(2+9) of 29 =13 Since sum of digits=sum of digits of prime factors 58 is a SMITH NUMBER SYNTAX: import java.io.*; class smith_no { static int sum,sum1;     public static void main(String args[])throws IOException     {         BufferedReader br=new BufferedReader(new InputStreamReader(System.in));         int n;int c=0;         System.out.println("Enter a Number");         n=Integer.parseInt(br.readLine());         int n1=n;         while(n1!=0){         int d=n1%10;         sum1+=d; ...
Post a Comment
Read more