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 augmented alphabetical order, -1 if the second string appears before the first in augmented 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 bubble-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;
#define MAX 12

int string_compare(char** A,int j)
{
	int i=0;

	while(true)
	{
		if(A[j][i]== 0 && A[j+1][i] == 0) return 0;
		if(A[j][i]== 0) return -1;
		if(A[j+1][i]== 0) return +1;
		if(A[j][i]<A[j+1][i]) return -1;
		if(A[j][i]>A[j+1][i]) return +1;
		i++;
	}

	return 0;
}

void swap(char** A,int j)
{
	char temp[MAX];

	for(int i=0;i<12;i++)
	temp[i]=A[j][i];
	for(int i=0;i<12;i++)
	A[j][i]=A[j+1][i];
	for(int i=0;i<12;i++)
	A[j+1][i]=temp[i];


}

char** string_sort(char** A,int n,int& c,int& s)
{
	int i,j;
	c=0;s=0;
	for(i=0;i<n-1;i++)
	{
		for(j=0;j<n-i-1;j++)
		{	int f;
			f=string_compare(A,j);
			if(f==-1)
			 {
			swap(A,j);
			s++;
			 }
			c++;

		}
	}

	return A;

}

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[MAX];
		}

	for(int i=0;i<n;i++)
	{
		cin>>A[i];
	}


	char** Ar=new char*[n];
	for(int j=0;j<n;j++)
		{
			Ar[j]=new char[MAX];
		}

	Ar=string_sort(A,n,c,s);

	for(int i=0;i<n;i++)
		{
			cout<<Ar[i]<<" ";

		}
		cout<<endl<<c<<" "<<s;
}

Grading criterion: Eg Use of functions beyond what was instructed or any other nice quality
Rating A: Some extra nice qualities
Rating B: 0
Rating C: 0
Rating D: Nothing Extra
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 augmented alphabetical order, -1 if the second string appears before the first in augmented 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 bubble-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;
#define MAX 11

char**allocate_2d(char**A,int n)
{
A=new int*[m];
for(int i=0;i<MAX;i++)
{
A[i]=new int[MAX];
}

return A;
}

int string_compare(char*f,char*s)
{
int i=0;
while(true)
{
if(*(f+i)==0 &&*(s+i)==0)) return 0;
if(*(f+i)==0 ) return -1;
if(*(s+i)==0) return +1;
if(*(f+i)<*(s+i)) return -1;
if(*(f+i)>*(s+i)) return +1;
i++;
}
}
int string_length (char *x)
{
	int L = 0;
	while (x[L] != ‘\0’) L++;
return L;
}

void string_reverse_in_place (char* s){
int n = string_length(s);
for(int i=0;i<n/2;i++) swap(&s[i],&s[n-1-i]);
s[n] = 0;
}

void  string_sort(char*c)
{

for(int i=0;i<n;i++)
{
for(int j=0;j<n-1-i;j++)
{ int l=string_compare(c[j],c[j+1]);
  if (l==+1) { char*temp=c[j];
                      c[j+1]=c[j];
                      c[j]=temp;
                }
}
}

int main(){

char**c;
int n;
cin>>n;
c=allocate_2d(c,n);
for(int i=0;i<n;i++)
{  cin>>c[i];

}
for(i=0;i<n;i++)
{
 string_reverse_in_place(c[i]);
}
for(int i=0;i<n;i++){
 string_Sort(c[i);
}

}

Grading criterion: Eg Use of functions beyond what was instructed or any other nice quality
Rating A: Some extra nice qualities
Rating B: 0
Rating C: 0
Rating D: Nothing Extra
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 augmented alphabetical order, -1 if the second string appears before the first in augmented 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 bubble-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 input_arr(char A[][12], int n)
{
int count=0;
for(int i=0;i<=n;i++)
{
cin.getline(A[count++],12);
}
}
int string_compare (char *first, char * second)
{
int i = 0;
while (true)
{
if (first[i] == 0 && second[i] == 0) 
{
cout<<"Number of string_compare operations = "<<i;return 0;}
if (first[i] == 0) {cout<<"Number of string_compare operations = "<<i;return -1;}
if (second[i] == 0) {cout<<"Number of string_compare operations = "<<i;return +1;}
if (first[i] < second[i]) {cout<<"Number of string_compare operations = "<<i;return -1;}
if (first[i] > second[i]) {cout<<"Number of string_compare operations = "<<i;return +1;}
i++;
}

return 0;
}
void swap (char& a, char& b )
{
char temp = a; a = b; b = temp; 
}
void bubble_sort(char *A, int l )
{
for (int i = 0; i < l- 1; i++)
{
for (int j = 0; j < l - i - 1; j++)
{
if (A[j] < A[j + 1])
swap(A[j],A[j + 1]);
}
}
}
void string_sort(char A[][12], int n)
{
for(int i=0;i<n;i++)
{
int l=strlen(A[i]);
bubble_sort(A[i],l);
}
}
void output_arr(char A[][12], int n)
{
for(int i=0;i<=n;i++)
cout<<A[i]<<endl;
}
int main()
{
char A[20][12];
int n;
char first[12];
char second[12];
cin>>first;
cin>>second;
cout<<string_compare(first, second);
cin>>n;
input_arr(A,n);
string_sort(A,n);
output_arr(A,n);
return 0;
}

Grading criterion: Eg Use of functions beyond what was instructed or any other nice quality
Rating A: Some extra nice qualities
Rating B: 0
Rating C: 0
Rating D: Nothing Extra
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 augmented alphabetical order, -1 if the second string appears before the first in augmented 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 bubble-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;
#define MAX 100

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 swap(char*&a, char*&b){
	char*t = a;
	a = b;
	b = t;
}

void reorder(char arr[][MAX], int n, int &comp_count, int &swap_count){
	
	for(int i=0;i<n;i++){
		for(int j=0; j<n-i-1;j++){
			if(string_compare(arr[j], arr[j+1]) == 1){
				swap(arr[j], arr[j+1]);
				swap_count++;
			}
			comp_count++;
		}
	}

}

int main(){

	int n, comp, swap;
	cout<<"Enter number of words : ";
	cin >> n;
	char arr[n][MAX];
	for(int i=0; i<n ;i++){
		cin>>arr[i];
	}
	comp=0;
	swap=0;
	reorder(arr, n,comp,swap);
	for(int i=0; i<n; i++){
		cout<<arr[i]<< endl;
	}
	cout<<comp<<endl;
	cout<<swap<<endl;
}

Grading criterion: Eg Use of functions beyond what was instructed or any other nice quality
Rating A: Some extra nice qualities
Rating B: 0
Rating C: 0
Rating D: Nothing Extra
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 augmented alphabetical order, -1 if the second string appears before the first in augmented 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 bubble-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 *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++;
}compared++;

return 0;}



void string_reverse(char* a, int n){
int i,j;
int swapped;
for (int i=0;i<n-1;i++)
	{for(j=0;j<n-1-i;j++)
{ if (a[j]<a[j+1]){
  swapped=0;
  swap(&a[i],&a[n-1-i]);
swapped++;
}}
cout<<a;
cout<<swapped<<"times swapped"<<endl;
}

}


int main(){
int n;
int compared;
cin>>n;
	char A[n][12];
	int count=0;
	while(cin.getline(A[count++],12));
	cout<<"strings taken"<<endl;
for(int i=0;i<count;i++) cout<<i<<A[i]<<endl;
for(int k=0;k<n;k++)
{
	for(int l=0;l<n; l++)
 	{
	 compared=0;
 	string_compare(A[k],A[l]);
	compared++;
	}
}
cout<<compared<<"times compared"<<endl;

for(int i=0;i<n;i++)
	{	
	string_reverse(A[i],strlen(A[i]));
	
	}
	
}

Grading criterion: Eg Use of functions beyond what was instructed or any other nice quality
Rating A: Some extra nice qualities
Rating B: 0
Rating C: 0
Rating D: Nothing Extra
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 augmented alphabetical order, -1 if the second string appears before the first in augmented 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 bubble-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 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 swap (char a[12], char b[12]){
char *t;
string_copy(t,a);
string_copy(a,b);
string_copy(b,t); return;
}
int strlen (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_sort(char A[][12], int n,int& l,int &k)
{
    int i, j;
    for (i = 0; i < n - 1; i++)
    {
        // Last i elements will be in place after this for loop
        for (j = 0; j < n - i - 1; j++)
        {k++;
            if (string_compare (A[j],A[j+1])==1 ){l++;
                swap(&A[j], &A[j + 1]);}
        }
    }
 
}

int main(){
int n,l=0;
cin>>n;
int k=0;
char a[n][12];
for(int i=0;i<n;i++){
cin>>a[i];}


string_sort(a, n,l,k);
for(int i=0;i<n;i++){
cout<<a[i]<<endl;}

cout<<k<<endl;
cout<<l;
}

Grading criterion: Eg Use of functions beyond what was instructed or any other nice quality
Rating A: Some extra nice qualities
Rating B: 0
Rating C: 0
Rating D: Nothing Extra
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 augmented alphabetical order, -1 if the second string appears before the first in augmented 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 bubble-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;
#define max 100
int strln (char *a) {
	int c = 0;
	for (int i = 0; a[i] != '\0'; i++) {
		c++;
	}
	return c;
}
void swap (char *a, char *b) {
	char temp[max];
	for (int i=0; i < strln (b); i++) {
		temp[i] = b[i];
	}
	temp [strln(b)] = '\0';
	for (int i=0; i < strln (a); i++) {
		b[i] = a[i]; 
	}
	b[strln(a)] = '\0';
	for (int i=0; i < strln (temp); i++) {
		a[i] = temp[i]; 
	}
	a[strln(temp)] = '\0';
}
int string_compare (char *a, char *b) {
	int c = 0;
	for (int i=0; a[i] != '\0' && b[i] != '\0'; i++) {
		if (a[i] > b[i]) {
			return -1;
		}
		else if (a[i] < b[i]) {
			return 1;
		}
		else {
			c++;
		}
	}
	if (strln (a) > strln (b)) {
		return -1;
	}
	else if (strln (a) < strln (b)) {
		return 1;
	}
	else if (c == strln (a) && c == strln (b)) {
		return 0;
	}
	return 0;
}
void string_sort (char a[][max], int n) {
	int c = 0, d = 0;
	for (int i = 0; i<n-1; i++) {
		for (int j =0; j<n-i-1; j++) {
			d++;
			if (string_compare (a[j], a[j+1]) == 1) {
				swap(a[j],a[j+1]);
				c++;
			}
		}
	}
	cout << c << " " << d;
}
int main () {
	int n;
	cin >> n;
	char str[n][max];
	for (int i = 0; i<n; i++) {
		cin >> str[i];
	}
	string_sort (str, n);
	for (int i = 0; i<n; i++) {
		cout << str[i] << " ";
	}
}

Grading criterion: Eg Use of functions beyond what was instructed or any other nice quality
Rating A: Some extra nice qualities
Rating B: 0
Rating C: 0
Rating D: Nothing Extra
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 augmented alphabetical order, -1 if the second string appears before the first in augmented 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 bubble-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 mergesort int[a][b];
int[a]=int [b] ;
cout<<int [i] (i++);
}
{
	int = (i,5,4) (int 1 , int 2 , int 3 );
	int[b]=int[a];
	int[a]=int[b];
	void transporse int[i]=int[j]


}
{
	int main();
	void transporse int(a,b,c,n)
	int [a,a-1,b](i++);
	int [b,b-1,a](j++);
return (0);
}	
}

Grading criterion: Eg Use of functions beyond what was instructed or any other nice quality
Rating A: Some extra nice qualities
Rating B: 0
Rating C: 0
Rating D: Nothing Extra
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 augmented alphabetical order, -1 if the second string appears before the first in augmented 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 bubble-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 s_comp_c = 0;


int string_compare(char* a, char* b){
	int i=0;
	s_comp_c++;
	while(1){
		if(!a[i] && !b[i]){
			return 0;
		}
		if(!a[i]){
			return 1;
		}
		if(!b[i]){
			return -1;
		}
		if(a[i]>b[i]){
			return -1;
		}
		if(a[i]<b[i]){
			return 1;
		}
		else
			i++;
	}
}


char** create(int n){
	char **A = new char*[n];
	for(int i=0;i<n;i++){
		A[i] = new char[100];
	}
	return A;
}


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


void swap(char *&a, char* &b){
	char c[100];
	int i=0;
	while(a[i]){
		c[i] = a[i];
		i++;
	}
	c[i] = 0;
	i=0;
	while(b[i]){
		a[i] = b[i];
		i++;
	}
	a[i] = 0;
	i=0;
	while(c[i]){
		b[i] = c[i];
		i++;
	}
	b[i] = 0;
}


int string_sort(char** A, int n){
	int k=0;
	bool flag = false;
	for(int i=0; i<n-1; i++){
		flag = false;
		for(int j=0;j<n-i-1; j++){
			if(string_compare(A[j],A[j+1])==1){
				flag = true;
				swap(A[j], A[j+1]);
				k++;
			}
		}
		if(!flag)
			break;
	}
	return k;
}


void display(char** A, int n){
	for(int i=0;i<n;i++){
		cout<<A[i]<<" ";
	}
}


void dealloc(char** A, int n){
	for(int i=0;i<n;i++)
		delete [] A[i];
	delete [] A;
}


int main(){
	int n;
	cin>>n;
	char **A = create(n);
	input(A, n);
	//display(A, n);
	int swap_c = string_sort(A, n);
	display(A, n);
	dealloc(A, n);
	cout<<endl<<s_comp_c<<" "<<swap_c;
}

Grading criterion: Eg Use of functions beyond what was instructed or any other nice quality
Rating A: Some extra nice qualities
Rating B: 0
Rating C: 0
Rating D: Nothing Extra
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 augmented alphabetical order, -1 if the second string appears before the first in augmented 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 bubble-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 string_compare(int arr[][4], int arr2[][4],int n1,int n2){
for(int i=0;i<3;i++){
for(int j=0;j<4;j++){
	if(arr[i][j]>arr2[i][j]) return 1;
	else(arr[i][j]<arr2[i][j]) return -1;
else return 0;
}
}
}

void string_sort(string A){

for(int i=0;i<3;i++){
	for (int j=0;j<4;j++){
	if(A[i][j]>A[i][j+1]) continue;
	else swap(A[i][j],A[i][j+1];
}

}


int main(){
int n1,n2;
cin>>n1>>n2;
string A;
string b;
cin>>A;
cin>>b;
int arr1[3][4];
for(int i=0;i<3;i++){
for(int j=0;j<4;j++){
arr1[i][j]=A[i+j];
}
}
int arr2[3][4];
for(int i=0;i<3;i++){
for(int j=0;j<4;j++){
arr2[i][j]=b[i+j];
}
}

string_sort(A);
cout<<A;
return 0;
}

Grading criterion: Eg Use of functions beyond what was instructed or any other nice quality
Rating A: Some extra nice qualities
Rating B: 0
Rating C: 0
Rating D: Nothing Extra
Assigned grade: D