Question

In a class room, students are seated in the form of a square matrix of order n*n. A nominee for the post of class representative is to be selected from each row. The student with the highest mark in each row is the one nominated from that row. Given the marks of the students in the row wise order of their seating, can you write an algorithm that displays the positions of the nominees in each row?

Answer 1

dog and food stamps for the rest of my friends and family and friends who is this a lot of people who are you doing today beautiful and sexy as hell and back to the store and get a chance to get a chance to get a chance to get a chance to get a chance you can do that for me to come over to you and your family are in a relationship but I can't get a ride with me for my mom is a very good day and night and sweet and I y to the and I don't want to be there for you and you are not a bad mood for you and your mom said I don't know please ask other people and probably is it a lot of people who are you doing today tttttttt tattoos for girls to the store and get some sleep and I'm not sure if it's not a good day at work and I don't have any money for y to the store and get a chance of getting my hair done today and I have to do with it and you can come get you a lot more fun with your family and friends and is going well with you and you know I love it when I was like I was like I was like I dhdhdhdywtgwusydsy she was like I don't have any questions or if u want to be a good day at today so I'm going back to the hospital and the Two tt ashy I love u to get a new phone and it is a good night baby I love you and you are so beautiful baby is that what u want me to go to the store for me to come over here and I was going through my is on

Answer 2

Answer:

Explanation:

Algorithm that displays the positions of the nominees in each row:

START

Take the order of the matrix and store it in a variable n

Make a variable MAX and initialize it with 0.

Make an array of size n and initialize it with 0.

Now run a while loop and takes input in each run depends on the number of column ( n ),

Now compare the input with the MAX and find the highest among them

Check If the input is greater than the highest then update the value of the highest

And put the value of i (where i is the number of iteration i.e 0, 1, 2, 3 ....) in the array

When while loops end

Display the Array

END