Pointers and the BubbleSort

[CONNERtheBUSH]

I am getting an error when I use a pointer in part of my bubble sort. Can anyone help? The error occurs on lines 122 & 123 at the first open parentheses. It says expression must be a modifiable lvalue.

#include <iostream>
#include <fstream>
#include <iomanip>
#include <string>
using namespace std;

//student structure
struct Student
{
	string name;
	double score;
};

//function prototypes
void blanklines(int count);
void sortAscending(Student *pStudent, int size);
double Average(Student *pStudent, int size);

 int main()
 {
	 Student test;
	 Student *pStudent;
	 pStudent = &test;
	
	 //variables
	 double average;
	 int numScores;
	 double min = 0;
	 double max = 100;

	//title
	cout << "\t\t\t\tClass Average";
	cout << endl;				// Terminates the title and moves to new line

	blanklines(3);				// Output 3 blanklines

	//get scores
	cout << "How many test scores? ";
	cin >> numScores;

	blanklines(2);

	//error loop
	while(numScores <= 0)
	{
		cout << "Please enter a number greater than 0: ";
		cin >> numScores;
		cout << endl << endl;
	}

	//allocate memory
	pStudent = new Student[numScores];

	//enter names and test scores
	for(int i = 0; i < numScores; i++)
	{
		system("cls");
		blanklines(4);
		cout << "Please enter the name of Student " << i + 1;
		getline(cin, (*pStudent).name);
		cout << "\t\tPlease enter the score for " << (*pStudent).name[i]
			<< i + 1 << ": ";
		cin >> (*pStudent).score;

		//error loop
		while((*pStudent).score < min || (*pStudent).score > max)
		{
			cout << "\n\nPlease enter a number greater than or equal to 0\n"
				<< "or less than or equal to 100: ";
			cin >> (*pStudent).score;
			cout << endl << endl;
		}
	}

	//call sort
	sortAscending(&test, numScores);

	system("cls");

	//title
	cout << "\t\t\t\tClass Average";
	cout << endl;				// Terminates the title and moves to new line

	blanklines(3);				// Output 3 blanklines

	//display scores
	cout << "Your test scores are:\n";
	for(int i = 0; i < numScores; i++)
	{
		cout << "  " << ((*pStudent).score + i);
		cout << endl;
	}

	//display average
	blanklines(1);
	cout << "Your average score is " << Average(&test, numScores);

	//seperate output from environment
	blanklines(10);

	//free allocated mem
	delete [ ] pStudent;
	pStudent = 0;
	return 0;
 }

 //function sortAscending
 void sortAscending(Student *pStud, int size)
 {
	 int templarge;
	 int tempsmall;
	 bool swap;

	 do
	 { swap = false;
	 for (int count = 0; count < (size - 1); count++)
	 {
		 if (((*pStud).score + count) > ((*pStud).score + (count + 1)))
		 {
			 templarge = ((*pStud).score + count);
			 tempsmall = ((*pStud).score + (count + 1));
			 ((*pStud).score + count) = tempsmall;
			 ((*pStud).score + (count + 1)) = templarge;
			 swap = true;
		 };
	 }
	 } while (swap);
 }

 //function average
 double Average(Student *pStudent, int size)
 {
	 double sum = 0;
	
	 for (int i = 0; i < size; i++)
		 sum = sum + ((*pStudent).score + i);

	 return sum / size;
 }

 void blanklines(int count)
 {
	 int i;		// Counter

	// Output blanklines
	for (i = 0; i < count; i++)
		cout << endl;
 }

[ui uiho]

sorting objects is different than sorting single data types. ill use an object Card as an example:
so we have our class here

class Card{
public: //do not ussually do that
         int value;
         char suit; 
};

so now we need our vector(or array) of Cards.
std::vector<Card> deck;
now that we have that lets use the std::sort function on the algorithms library.
for this we need 2 random access iterators and a compare class function. the function will look like this

bool sortorder(const card &a, const card &b){
    if(a.suit < b.suit) 
        return true; 
    if(a.suit == b.suit){
        if(a.value < b.value)
            return true;
    }
    return false; 
}

so now lets plug it in.
std::sort(deck.begin(), deck.end(), sortorder); and there we go. it is now properly sorted.
i hope this helps for how to sort objects.
also please remove your system commands please.