C / C++ / MFC

// check for multiple students
std::vector< std::string > names(sheet->UsedRows() );
std::set< std::string > list;
short col = -1;
for (int i=0;i<sheet->UsedCols();i++) {
    if (head[i].type == NAME)
        col = head[i].column;
}
if (col == -1)
    return 0;
for (i=xRow;i<sheet->UsedRows();i++) {
    names[i] = sheet->Cell(col,i);
    list.insert( sheet->Cell(col,i) );
}
int sz = names.size();
sort(names.begin(),names.end() );
names.erase( unique(names.begin(),names.end() ),names.end() );
int foo = list.size();
int bar = names.size();

<br />
void Sample::quicksort(signed long int top, signed long int bottom){<br />
	signed int long middle;<br />
	if (top < bottom){<br />
		middle = partition(top, bottom);<br />
		quicksort(top, middle);<br />
		quicksort(middle+1, bottom);<br />
	}<br />
	return;<br />
}<br />
<br />
<br />
signed long int Sample::partition(signed long int top, signed long int bottom){<br />
	double x = *(m_data + top);<br />
	signed long int i = top - 1;<br />
	signed long int j = bottom + 1;<br />
	double temp;<br />
	do{<br />
		do{<br />
			j--;<br />
		}while (x > *(m_data+j));<br />
<br />
		do{<br />
			i++;<br />
		}while (x < *(m_data+i));<br />
		if (i < j){<br />
			temp = *(m_data+i);<br />
			*(m_data+i) = *(m_data+j);<br />
			*(m_data+j) = temp;<br />
		}<br />
	}while (i < j);     <br />
	return j;           // returns middle index <br />
}<br />