Student Class Compare Id

[neel3123]

Write your question here.
Hey everyone,
I am writing a program that takes an input for students id (and several other things) and it has to compare all of them and display in least to greatest order. I don't how I can use my code to make it work. Please help.

// Student Class.cpp : Defines the entry point for the console application.
//

#include "stdafx.h"
#include <iostream>
#include <string>
#include <iomanip>
using namespace std;

class student
{
public:
	int age;
	int grade;
	int id;
	string name;
public:
	void setAge (int a)
	{
		age=a;
	}
	void setGrade (int g)
	{
		grade=g;
	}
	void setId (int i)
	{
		id = i;
	}
	void setName (string n)
	{
		name = n;
	}
	int getAge ()
	{
		return age;
	}
	int getGrade ()
	{
		return grade;
	}
	int getId()
	{
		return id;
	}
	string getName()
	{
		return name;
	}
	void print() {
		cout <<left << setw(15) << name << setw(8) << id << setw(8) << grade << age << endl;
	}
};
int _tmain(int argc, _TCHAR* argv[])
{
	student students[5];
	for(int x=0; x<5; x++)
	{
		cout<< "Enter Name"<<endl;
		cin>> students[x].name;
		cout<< "Enter Age"<<endl;
		cin>> students[x].age;
		cout<< "Enter Grade"<<endl;
		cin>> students[x].grade;
		cout<< "Enter Id"<<endl;
		cin>> students[x].id;
	}
	for(int x=0; x<5; x++)
	{
		students[x].print();
	}
	int min;
	int min2;
	int min3;
	int min4;
	int min5;
	for(int y=1; y<6; y++)
	{
	/*int number1 = students[y].id / 10000 ;
	int number2 = students[y].id %10000/1000;
	int number3 = students[y].id %1000 / 100;
	int number4 = students[y].id %100 / 10;
	int number5 = students[y].id %10;*/
	//cout<< number1 << number2 << number3 << number4 << number5<<endl;
		for(int z=0; z<5; z++)
		{
			if (students[z].id < students[z+1].id) 
			{
			}
			/*int number2_1 = students[z].id / 10000;
			int number2_2 = students[z].id % 10000 / 1000;
			int number2_3 = students[z].id %1000 / 100;
			int number2_4 = students[z].id %100 / 10;
			int number2_5 = students[z].id %10;*/
		} 
	}
	return 0;
}

[lsk]

In very easy to understand way,
You just loop and print the least one out, then mark it that you printed so not use to compare next time. Maybe another array or change it to -1;

i.e., use -1,
ID 5 3 4 7 6 -> loop find least and not -1 (3)
print 3, ID = 5 -1 4 7 6 -> loop find least and not -1 (4)
print 4, ID = 5 -1 -1 7 6 -> etc.

This is technique like Selection Sort.

And if you want to order them in array before print. Use keyword Sort Algorithm and learn, very smart to go.

[neel3123]

Im sorry I don't understand what your tying to say.

[neel3123]

Could you provide code example?

[neel3123]

Can anyone else help?

[shadowCODE]

you should use any sorting algorithm like bubble sort or selection sort to arrange the students in order of IDs as you want.

Add this code betwen line 67 and 68. i.e before the loop that prints.
I dont know what lines 72 - 96 are for. In my opinion, you should delete it.

/*bubble sort algorithm*/
for(int i = 0; i < 5; i++)
{
    for(int j = i + 1; j < 5; j++)
    {
        if(students[i].getId() > students[j].getId())
        {
            /* swap positions in array of students*/
            student temp = students[i];
            students[i] = students[j];
            students[j] = temp;
        }
    }
}