array mark ,equal mark,small mark,highest mark, second highest mark

Program 1:

package afterfeb13;

public class secondgreater {
public static void main(String[] args) {
int[] mark = { 200, 100, 78, 89, 102 };
int highest = 0, second_highest = 0, third_highest = 0;
for (int i = 0; i < …


This content originally appeared on DEV Community and was authored by Neelakandan R

Program 1:

package afterfeb13;

public class secondgreater {
    public static void main(String[] args) {
        int[] mark = { 200, 100, 78, 89, 102 };
        int highest = 0, second_highest = 0, third_highest = 0;
        for (int i = 0; i < mark.length; i++) {
            if (mark[i] > highest)// 56>0//100>56---//102>100
            {
                second_highest = highest;
                highest = mark[i];

            } else if (mark[i] > second_highest) {
                third_highest = second_highest;
                second_highest = mark[i];
            } else if (mark[i] > third_highest) {
                third_highest = mark[i];
            }

        }

        System.out.println("highest num = " + highest);
        System.out.println("second_highest = " + second_highest);
        System.out.println("third_highest = " + third_highest);

    }

}

Output:

highest num = 200
second_highest = 102
third_highest = 100

Program 2:

package afterfeb13;

public class smallestnum {
    public static void main(String[] args) {
        int[] mark = { 200, 100, 78, 89, 102 };
        int small = mark[0];
        for (int i = 0; i < mark.length; i++) {
            if (mark[i] < small) {
                small = mark[i];
            }
        }
        System.out.println(small);

    }
}

Output:
78

Program 3:

package afterfeb13;

public class numberequal {
    public static void main(String[] args) {
        int[] mark = { 90, 81, 82, 90, 90 };
        String[]subject= {"tamil","english","maths","social","science"};
        int count = 0;
        for (int i = 0; i < mark.length; i++)
            if (mark[i] == 90) {
                System.out.println(subject[i]+"="+mark[i]);
                count++;
            }
        System.out.println("count = " + count);

    }

}


Output:
tamil=90
social=90
science=90
count = 3


This content originally appeared on DEV Community and was authored by Neelakandan R


Print Share Comment Cite Upload Translate Updates
APA

Neelakandan R | Sciencx (2025-02-20T15:24:42+00:00) array mark ,equal mark,small mark,highest mark, second highest mark. Retrieved from https://www.scien.cx/2025/02/20/array-mark-equal-marksmall-markhighest-mark-second-highest-mark/

MLA
" » array mark ,equal mark,small mark,highest mark, second highest mark." Neelakandan R | Sciencx - Thursday February 20, 2025, https://www.scien.cx/2025/02/20/array-mark-equal-marksmall-markhighest-mark-second-highest-mark/
HARVARD
Neelakandan R | Sciencx Thursday February 20, 2025 » array mark ,equal mark,small mark,highest mark, second highest mark., viewed ,<https://www.scien.cx/2025/02/20/array-mark-equal-marksmall-markhighest-mark-second-highest-mark/>
VANCOUVER
Neelakandan R | Sciencx - » array mark ,equal mark,small mark,highest mark, second highest mark. [Internet]. [Accessed ]. Available from: https://www.scien.cx/2025/02/20/array-mark-equal-marksmall-markhighest-mark-second-highest-mark/
CHICAGO
" » array mark ,equal mark,small mark,highest mark, second highest mark." Neelakandan R | Sciencx - Accessed . https://www.scien.cx/2025/02/20/array-mark-equal-marksmall-markhighest-mark-second-highest-mark/
IEEE
" » array mark ,equal mark,small mark,highest mark, second highest mark." Neelakandan R | Sciencx [Online]. Available: https://www.scien.cx/2025/02/20/array-mark-equal-marksmall-markhighest-mark-second-highest-mark/. [Accessed: ]
rf:citation
» array mark ,equal mark,small mark,highest mark, second highest mark | Neelakandan R | Sciencx | https://www.scien.cx/2025/02/20/array-mark-equal-marksmall-markhighest-mark-second-highest-mark/ |

Please log in to upload a file.




There are no updates yet.
Click the Upload button above to add an update.

You must be logged in to translate posts. Please log in or register.