CodeGraderBench/CodeGraderBench huggingface dataset:
Problem: Write a C++ program to collect a positive integer n from the user, and then collect n character strings from the user (containing only lower case alphabets and no other characters, not even spaces). The strings need not be of equal length but the maximum length of any string should be 11. The strings should be stored in an appropriate 2D array. Your program should then include the following:

1. A function string_compare which takes two strings as input and returns 1 if the first string appears before the second string in alphabetical order, -1 if the second string appears before the first in alphabetical order, and 0 if the two strings are equal to each other. 

2. A function string_sort which sorts the character strings in reverse alphabetical order using the selection-sort algorithm.

Your program should also print the number of string_compare operations (i.e. how many times the string_compare routine was called) and the number of string swaps performed. 

Constraints
n is a positive integer, n < 15

The maximum length of any of the strings should be 11, excluding the NULL character

The character strings should contain only lower case alphabets

Student submission:
#include<iostream>
using namespace std;

void input(char arr[][12], int n){
	for(int i = 0; i < n; i++){
		cin >> arr[i];
	}

}

void print(char arr[][12], int n){
	for(int i = 0; i < n; i++){
		cout << arr[i] << endl;
	}
}



int string_length(char str[]){
	int l = 0;

	while(str[l] != 0) l++;

	return l;
}

int string_compare(char str1[], char str2[]){
	int n1 = string_length(str1), n2 = string_length(str2); 
	int n = min(n1,n2);
	for(int i = 0; i < n; i++){
		if(str1[i] < str2[i])
			return 1;
		else if(str1[i] > str2[i])
			return -1;
		else 
			continue;
	}
	if(n1 < n2)
		return 1;
	else if(n1 > n2)
		return -1;
	else 
		return 0;
}

void string_copy(char str1[], char str2[]){
	for(int i = 0; i < 12; i++){
		str2[i] = str1[i];
	}
}

void string_swap(char arr[][12], int a, int b){
	char temp[12];
	string_copy(arr[a],	temp	);
	string_copy(arr[b],	arr[a]	);
	string_copy(temp,	arr[b]	);
}

void string_sort(char arr[][12], int n,  int &stringCompares, int &stringSwaps){

	int index_of_largest_str;

	for(int i = 1; i < n; i++){
		index_of_largest_str = i -1;
		for(int j = i; j < n; j++){
			if( string_compare(arr[index_of_largest_str], arr[j]) == 1){
				index_of_largest_str = j;
				
			}
			stringCompares++;
		}
		if(index_of_largest_str != i-1){
			string_swap(arr, index_of_largest_str, i-1);
			stringSwaps++;
		}
	}
}



int main(){
	int n;
	cin >> n;

	
	char arr[n][12];

	input(arr, n);

	int stringCompares = 0, stringSwaps = 0;
 	string_sort(arr,n, stringCompares, stringSwaps);

	print(arr,n);

	cout << stringCompares << endl << stringSwaps << endl;

}

Grading criterion: string_compare implementation
Rating A: Fully Correct
Rating B: Almost Correct
Rating C: Tried something in somewhat right direction
Rating D: Code not there or totally wrong
Assigned grade: A
Problem: Write a C++ program to collect a positive integer n from the user, and then collect n character strings from the user (containing only lower case alphabets and no other characters, not even spaces). The strings need not be of equal length but the maximum length of any string should be 11. The strings should be stored in an appropriate 2D array. Your program should then include the following:

1. A function string_compare which takes two strings as input and returns 1 if the first string appears before the second string in alphabetical order, -1 if the second string appears before the first in alphabetical order, and 0 if the two strings are equal to each other. 

2. A function string_sort which sorts the character strings in reverse alphabetical order using the selection-sort algorithm.

Your program should also print the number of string_compare operations (i.e. how many times the string_compare routine was called) and the number of string swaps performed. 

Constraints
n is a positive integer, n < 15

The maximum length of any of the strings should be 11, excluding the NULL character

The character strings should contain only lower case alphabets

Student submission:
#include<iostream>
using namespace std;
int argmax (float *scores, int L){
	int maxindex = 0;
	for(int j=1; j<L; j++){
		if(scores[maxindex] < scores[j]) maxindex = j;	
	}
	return maxindex;
}
void selection_sort (float *data, int n){
for(int i=n; i>1;i--){
int maxindex = argmax(data,i); 
myswap(&data[maxind}
ex],&data[i-1]); 
}
int string_compare (char *first, char * second){
int i = 0;
while (true){
if (first[i] == 0 && second[i] == 0) return 0;
if (first[i] == 0) return -1;
if (second[i] == 0) return +1;
if (first[i] < second[i]) return -1;
if (first[i] > second[i]) return +1;
i++;
}
return 0;
}
int main(){ 
	int n;
	cin>>n;
char name[n][11];
int count=0;
while (cin.getline(name[count++], 11));
for (int i=0; i<count; i++)
cout << "\t" << i << ". [" << name[i] << "]" << endl;
	
}

Grading criterion: string_compare implementation
Rating A: Fully Correct
Rating B: Almost Correct
Rating C: Tried something in somewhat right direction
Rating D: Code not there or totally wrong
Assigned grade: B
Problem: Write a C++ program to collect a positive integer n from the user, and then collect n character strings from the user (containing only lower case alphabets and no other characters, not even spaces). The strings need not be of equal length but the maximum length of any string should be 11. The strings should be stored in an appropriate 2D array. Your program should then include the following:

1. A function string_compare which takes two strings as input and returns 1 if the first string appears before the second string in alphabetical order, -1 if the second string appears before the first in alphabetical order, and 0 if the two strings are equal to each other. 

2. A function string_sort which sorts the character strings in reverse alphabetical order using the selection-sort algorithm.

Your program should also print the number of string_compare operations (i.e. how many times the string_compare routine was called) and the number of string swaps performed. 

Constraints
n is a positive integer, n < 15

The maximum length of any of the strings should be 11, excluding the NULL character

The character strings should contain only lower case alphabets

Student submission:
#include<simplecpp>
int string_compare(char *a,char *b)
{
int i=0;
	while(true)
{
	if(a[i]==0 && b[i]==0) return 0;
	if(a[i]==0) return -1;
	if(a[i]==0) return -1;

	if(a[i]<b[i]) return -1;
	f(a[i]>b[i]) return 1;
	i++;
	}
return 0;
}




main_program{
int n;
cin>>n;

char a[12][12];
char b[12][12];

	cin.getline(a,n);
	
	cin.getline(b,n);
	
	
	string_compare(a,b);
	
}

Grading criterion: string_compare implementation
Rating A: Fully Correct
Rating B: Almost Correct
Rating C: Tried something in somewhat right direction
Rating D: Code not there or totally wrong
Assigned grade: B
Problem: Write a C++ program to collect a positive integer n from the user, and then collect n character strings from the user (containing only lower case alphabets and no other characters, not even spaces). The strings need not be of equal length but the maximum length of any string should be 11. The strings should be stored in an appropriate 2D array. Your program should then include the following:

1. A function string_compare which takes two strings as input and returns 1 if the first string appears before the second string in alphabetical order, -1 if the second string appears before the first in alphabetical order, and 0 if the two strings are equal to each other. 

2. A function string_sort which sorts the character strings in reverse alphabetical order using the selection-sort algorithm.

Your program should also print the number of string_compare operations (i.e. how many times the string_compare routine was called) and the number of string swaps performed. 

Constraints
n is a positive integer, n < 15

The maximum length of any of the strings should be 11, excluding the NULL character

The character strings should contain only lower case alphabets

Student submission:
#include<iostream>
using namespace std;
 int string_compare (char *a, char *b){
int i = 0;
while (true){
if (a[i] == 0 && b[i] == 0) return 0;
if (a[i] == 0) return 1;
if (b[i] == 0) return -1;
if (a[i] < b[i]) return 1;
if (a[i] > b[i]) return -1;
i++;
}
return 0;
}
int fmin( char **a,int n,int &c){
int minindex = 0;
for(int j=1; j<n; j++){
int k=string_compare(a[minindex],a[j]);	
if(k==-1) minindex = j;
c++;	
}
return minindex;
}
void myswap(char* &a,char* &b){
char *temp=a;
a=b;
b=temp;
} 
void string_sort (char **&a, int n,int &c,int &s){
for(int i=n; i>1;i--){
int minindex = fmin(a,i,c); 
if(a[minindex]!=a[i-1]) s++;
myswap(a[minindex],a[i-1]);
}
}
int main(){
int n,c=0,s=0;
cin>>n;
char **a=new char*[n];
for(int i=0; i<n; i++) a[i]=new char[12];
for(int i=0; i<n; i++) cin>>a[i];
string_sort(a,n,c,s);
for(int i=0; i<n; i++) cout<<a[i]<<endl;
cout<<c<<endl<<s;
}

Grading criterion: string_compare implementation
Rating A: Fully Correct
Rating B: Almost Correct
Rating C: Tried something in somewhat right direction
Rating D: Code not there or totally wrong
Assigned grade: A
Problem: Write a C++ program to collect a positive integer n from the user, and then collect n character strings from the user (containing only lower case alphabets and no other characters, not even spaces). The strings need not be of equal length but the maximum length of any string should be 11. The strings should be stored in an appropriate 2D array. Your program should then include the following:

1. A function string_compare which takes two strings as input and returns 1 if the first string appears before the second string in alphabetical order, -1 if the second string appears before the first in alphabetical order, and 0 if the two strings are equal to each other. 

2. A function string_sort which sorts the character strings in reverse alphabetical order using the selection-sort algorithm.

Your program should also print the number of string_compare operations (i.e. how many times the string_compare routine was called) and the number of string swaps performed. 

Constraints
n is a positive integer, n < 15

The maximum length of any of the strings should be 11, excluding the NULL character

The character strings should contain only lower case alphabets

Student submission:
#include<iostream>
#include <cstring>
using namespace std;

void print2Darray (char A[][100], int n1, int n2){
int i,j;
for(i=0;i<n1;i++){
		for(j=0;j<n2;j++){
			cout << A[i][j];
		}
		cout << endl;
}
}
int string_length (char* x)
{
	int L = 0;
	while (x[L] != '\0') L++;
return L;
}

int string_compare (char *first, char * second){
	int i = 0;
	while (true){
		if (first[i] == 0 && second[i] == 0) return 0;
		if (first[i] == 0) return +1;
		if (second[i] == 0) return -1;
		if (first[i] < second[i]) return +1;
		if (first[i] > second[i]) return -1;
		i++;
	}
	return 0;
}
void string_copy (char *dest, const char* source) {
	int i;
	for(i=0;source[i]!= ‘\0’;i++){
		dest[i] = source[i];
	}
	dest[i] = source[i];
	}

void myswap (char &a, char &b){
	char *copy;
	string_copy(copy,a);
	string_copy(a,b);
	string_copy(b,copy);

}

int argmax (char s[][100], int L){
	int maxindex = 0;
	int count = 0;
	for(int j=1; j<L; j++){
		if(string_compare(s[maxindex],s[j])==1) {maxindex = j; count++;}

	}
	cout<<count;
	return maxindex;
}

void string_sort (char s[][100], int n){
	for(int i=n; i>1;i--){
		int maxindex = argmax(s,i);
		myswap(&s[maxindex],&s[i-1])
	}
}


int main(){
	int n;
	cin>>n;
	char A[100][100];

	int i=0;
	while(i<n){
		char x[12];
		cin>>x;
		int m = string_length(x);
		int j = 0;
		while (j<m){
			A[i][j] = x[j];
			j++;
		}
		i++;
	}

	string_sort(A,n);
	print2Darray(A,n,12);


}

Grading criterion: string_compare implementation
Rating A: Fully Correct
Rating B: Almost Correct
Rating C: Tried something in somewhat right direction
Rating D: Code not there or totally wrong
Assigned grade: A
Problem: Write a C++ program to collect a positive integer n from the user, and then collect n character strings from the user (containing only lower case alphabets and no other characters, not even spaces). The strings need not be of equal length but the maximum length of any string should be 11. The strings should be stored in an appropriate 2D array. Your program should then include the following:

1. A function string_compare which takes two strings as input and returns 1 if the first string appears before the second string in alphabetical order, -1 if the second string appears before the first in alphabetical order, and 0 if the two strings are equal to each other. 

2. A function string_sort which sorts the character strings in reverse alphabetical order using the selection-sort algorithm.

Your program should also print the number of string_compare operations (i.e. how many times the string_compare routine was called) and the number of string swaps performed. 

Constraints
n is a positive integer, n < 15

The maximum length of any of the strings should be 11, excluding the NULL character

The character strings should contain only lower case alphabets

Student submission:
#include<simplecpp>
using namespace std;

void input_string(char x,int n)
{
   char x[100]; 
   cin.getline(x,n);
}
int string_compare (char *first, char * second){
int i = 0;
while (true){
if (first[i] == 0 && second[i] == 0) return 0;
if (first[i] == 0) return -1;
if (second[i] == 0) return +1;
if (first[i] < second[i]) return -1;
if (first[i] > second[i]) return +1;
i++;
}
return 0;
}
void string_reverse(char* s, char* rev_s){
int n = string_length(s);
for(int i=0;i<n;i++) rev_s[n-1-i] = s[i]; 
rev_s[n] = 0;

Grading criterion: string_compare implementation
Rating A: Fully Correct
Rating B: Almost Correct
Rating C: Tried something in somewhat right direction
Rating D: Code not there or totally wrong
Assigned grade: B
Problem: Write a C++ program to collect a positive integer n from the user, and then collect n character strings from the user (containing only lower case alphabets and no other characters, not even spaces). The strings need not be of equal length but the maximum length of any string should be 11. The strings should be stored in an appropriate 2D array. Your program should then include the following:

1. A function string_compare which takes two strings as input and returns 1 if the first string appears before the second string in alphabetical order, -1 if the second string appears before the first in alphabetical order, and 0 if the two strings are equal to each other. 

2. A function string_sort which sorts the character strings in reverse alphabetical order using the selection-sort algorithm.

Your program should also print the number of string_compare operations (i.e. how many times the string_compare routine was called) and the number of string swaps performed. 

Constraints
n is a positive integer, n < 15

The maximum length of any of the strings should be 11, excluding the NULL character

The character strings should contain only lower case alphabets

Student submission:
#include<cstring>
#include<iostream>
using namespace std;
int main()
{
int n;
cin >>n, 
cin>>m;




int string_compare(char *first ,char *second){
int i = 0;
while (true){
if (first[i] == 0 && second[i] == 0) return 0;
else (first[i] == 0 && first [i]>second [i]) {
cout << first[i];
else if (second [i] == 0 && first [i]< second [i]){ 
int temp = *first;
*first = * second;
*second = *first;

Grading criterion: string_compare implementation
Rating A: Fully Correct
Rating B: Almost Correct
Rating C: Tried something in somewhat right direction
Rating D: Code not there or totally wrong
Assigned grade: D
Problem: Write a C++ program to collect a positive integer n from the user, and then collect n character strings from the user (containing only lower case alphabets and no other characters, not even spaces). The strings need not be of equal length but the maximum length of any string should be 11. The strings should be stored in an appropriate 2D array. Your program should then include the following:

1. A function string_compare which takes two strings as input and returns 1 if the first string appears before the second string in alphabetical order, -1 if the second string appears before the first in alphabetical order, and 0 if the two strings are equal to each other. 

2. A function string_sort which sorts the character strings in reverse alphabetical order using the selection-sort algorithm.

Your program should also print the number of string_compare operations (i.e. how many times the string_compare routine was called) and the number of string swaps performed. 

Constraints
n is a positive integer, n < 15

The maximum length of any of the strings should be 11, excluding the NULL character

The character strings should contain only lower case alphabets

Student submission:
#include<iostream>
using namespace std;
int main() {
 int n;
 cout<<" enter the number of element:
 cin>> n;
 int a [i]
 for(int i=0; i<n; i++)
 {
 cin a[i];
 }
 cout<<"before swap"<<endl;
 for (int i=0; i<n; i++)
 {
 cout<< a[i]
 }
 cout<<"after swap"<<endl;
 for (int i=n-1; i>=0; i--)
 {
 cout<< a[i]
 }
 return 0;

Grading criterion: string_compare implementation
Rating A: Fully Correct
Rating B: Almost Correct
Rating C: Tried something in somewhat right direction
Rating D: Code not there or totally wrong
Assigned grade: D
Problem: Write a C++ program to collect a positive integer n from the user, and then collect n character strings from the user (containing only lower case alphabets and no other characters, not even spaces). The strings need not be of equal length but the maximum length of any string should be 11. The strings should be stored in an appropriate 2D array. Your program should then include the following:

1. A function string_compare which takes two strings as input and returns 1 if the first string appears before the second string in alphabetical order, -1 if the second string appears before the first in alphabetical order, and 0 if the two strings are equal to each other. 

2. A function string_sort which sorts the character strings in reverse alphabetical order using the selection-sort algorithm.

Your program should also print the number of string_compare operations (i.e. how many times the string_compare routine was called) and the number of string swaps performed. 

Constraints
n is a positive integer, n < 15

The maximum length of any of the strings should be 11, excluding the NULL character

The character strings should contain only lower case alphabets

Student submission:
#include <iostream>
using namespace std;
int p=0;
int q=0;

int string_compare (char *first, char * second)
{
	p=p+1;
	int i = 0;
	while (true){
	if (first[i] == 0 && second[i] == 0) return 0;
	if (first[i] == 0) return +1;
	if (second[i] == 0) return -1;
	if (first[i] < second[i]) return +1;
	if (first[i] > second[i]) return -1;
	i++;
}
return 0;
}

void swap (char* &x, char* &y)
{
	char *temp=x;
	x=y;
	y=temp;
}


void string_sort (char s[][15], int n)
{
	for (int j=0; j<n-1; j++)
	{
	int mini = 0;
		for (int i=0; i<n-1-j; i++)
		{
			if (string_compare (s[i+1],s[mini]) == 1) {mini = i+1;}
		}
		if (mini!=n-j-1) {swap (s[mini],s[n-j-1]); q++;}
		
	}
	
}

int main ()
{
	int n;
	
	cin >> n;
	char s[n][15];
	for (int i=0; i<n; i++)
	{
		cin >> s[i];
	}
	
	string_sort(s,n);	
	
	for (int i=0; i<n; i++)
	{
		cout << s[i]<<endl;
	}
	cout << p << "\n" << q;
	
}

Grading criterion: string_compare implementation
Rating A: Fully Correct
Rating B: Almost Correct
Rating C: Tried something in somewhat right direction
Rating D: Code not there or totally wrong
Assigned grade: A
Problem: Write a C++ program to collect a positive integer n from the user, and then collect n character strings from the user (containing only lower case alphabets and no other characters, not even spaces). The strings need not be of equal length but the maximum length of any string should be 11. The strings should be stored in an appropriate 2D array. Your program should then include the following:

1. A function string_compare which takes two strings as input and returns 1 if the first string appears before the second string in alphabetical order, -1 if the second string appears before the first in alphabetical order, and 0 if the two strings are equal to each other. 

2. A function string_sort which sorts the character strings in reverse alphabetical order using the selection-sort algorithm.

Your program should also print the number of string_compare operations (i.e. how many times the string_compare routine was called) and the number of string swaps performed. 

Constraints
n is a positive integer, n < 15

The maximum length of any of the strings should be 11, excluding the NULL character

The character strings should contain only lower case alphabets

Student submission:
#include<cstring>
#include<iostream>
using namespace std;



int string_compare (char *first, char * second){
int i = 0;
while (true){
if (first[i] == 0 && second[i] == 0) return 0;
if (first[i] == 0) return +1;
if (second[i] == 0) return -1;
if (first[i] < second[i]) return +1;
if (first[i] > second[i]) return -1;
i++;
}
return 0;
}

int main(){ 
	int n;
	cin >> n;
	char name[n][12];
	int count=0;
	for(;count<=n;count++){
		cin.getline(name[count],12);
	}
	for(count = 0;count<=n;count++){
		cout << name[count] << " " ;
	}
	int swaps = 0;
	cout << swaps;
	
}

Grading criterion: string_compare implementation
Rating A: Fully Correct
Rating B: Almost Correct
Rating C: Tried something in somewhat right direction
Rating D: Code not there or totally wrong
Assigned grade: A
Problem: Write a C++ program to collect a positive integer n from the user, and then collect n character strings from the user (containing only lower case alphabets and no other characters, not even spaces). The strings need not be of equal length but the maximum length of any string should be 11. The strings should be stored in an appropriate 2D array. Your program should then include the following:

1. A function string_compare which takes two strings as input and returns 1 if the first string appears before the second string in alphabetical order, -1 if the second string appears before the first in alphabetical order, and 0 if the two strings are equal to each other. 

2. A function string_sort which sorts the character strings in reverse alphabetical order using the selection-sort algorithm.

Your program should also print the number of string_compare operations (i.e. how many times the string_compare routine was called) and the number of string swaps performed. 

Constraints
n is a positive integer, n < 15

The maximum length of any of the strings should be 11, excluding the NULL character

The character strings should contain only lower case alphabets

Student submission:
#include <iostream>
#include<cstring>
using namespace std;



int string_compare(char* a,char* b){

	if (a==b){
		return 0;
	}
	for (int i=0;i<min(strlen(a),strlen(b));i++){
		if (a[i]>b[i]){
			return 1;

		}
		if (b[i]>a[i]){
			return -1;

		}
	}
	if(strlen(b)>strlen(a)){

		return -1;

	}
	if(strlen(a)>strlen(b)){

		return 1;

	


}
}



char* string_sort(char** a ,int n){

	for(int i=n;i>0;i--)
	for(int =0;j<n;j++){

	}






}






int main(){

	int m,n;
	cin>>n;
	char** x=new char*[n];
	for(int i=0;i<n;i++){
		x[i] =  new char [13]; 
	}
	for(int j=0;j<n;j++){
		char s[12];
		cin>>s;

	 for(int i=0;i<strlen(s)+1;i++){
		

		x[j][i]=s[i];
}
}

char a[13];
char b[13];
string_compare(a,b);
	
// 	for(int i=0;i<n;i++){
// 		cout<<x[0];
// }

}

Grading criterion: string_compare implementation
Rating A: Fully Correct
Rating B: Almost Correct
Rating C: Tried something in somewhat right direction
Rating D: Code not there or totally wrong
Assigned grade: B