BubbleSort Algorithm..Counting Data Moves?

void bubbleSort (int list [], int last)
{
//	Local Definitions 
	int   current;
	int   walker;
	int   temp;
	bool  sorted;

//	Statements 
	// Each iteration is one sort pass 
	for (current = 0, sorted = false; 
	     current <= last && !sorted;
	     current++)
	   for (walker = last, sorted = true; walker > current; walker--)

	      if (list[walker]  < list[walker - 1])
	         // Any exchange means list is not sorted 
	         {
	          sorted           = false;
	          temp             = list[walker];
	          list[walker]     = list[walker - 1];
	          list[walker - 1] = temp;
	        
			 } 
			 



	return;
}	

oid bubbleSort (int list [], int last)
{
//	Local Definitions 
	int   current;
	int   walker;
	int   temp;
	int move = 0;
	bool  sorted;
        int numDataMoves = 0;
//	Statements 
	// Each iteration is one sort pass 
	for (current = 0, sorted = false; 
	     current <= last && !sorted;
	     current++)
	   for (walker = last, sorted = true; walker > current; walker--)

	      if (list[walker]  < list[walker - 1])
	         // Any exchange means list is not sorted 
                 // if they need tob be exchanged, increment the numDataMoves counter
	         {
	          sorted           = false;
	          temp             = list[walker];
	          list[walker]     = list[walker - 1];
	          list[walker - 1] = temp;
	          numDataMoves++;
			 } 
			 
			 cout << " \n  |Bubble Sort   |              " << temp << "number of data moves/swaps:" << numDataMoves;  


	return;
}