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;

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 selection_sort (float*data, int n){
for (int i=n; i>1; i--) {
	int maxindex=argmax(data, i) ;
	mySwap (&data[maxindex], &data[i-1]);
	}
}

Grading criterion: Sort is implemented in function string_sort.
Rating A: If implemented in function
Rating B: If not implemented in function.
Rating C: 0
Rating D: 0
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>
void bubble_sort(float *A, int n)
{
    int i, j;
    for (i = 0; i < n - 1; i++)
    {
        for (j = 0; j < n - i - 1; j++)
        {
            if (A[j] > A[j + 1])
                swap(&A[j], &A[j + 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 max(char *A,int n){
	int arr[n],arr1[n];int x;
	for(int i=0;i<n;i++){
		int l=0;
		for(int j=0;j<n;j++){
			l=l+string_compare(A[i],A[j]);
		}
		arr[i]=l;
	}
	for(int i=0;i<n;i++){
		arr1[i]=arr[i];
	}
	bubble_sort(arr,n);
	for(int i=0;i<n;i++){
		if(arr1[i]==arr[0]){x=i;}
	}
	return x;
} 
void string_sort(char *A,int n){
	for(int i=n; i>1;i--){
		int maxindex = max(A,i);
		char temp[]="A[maxindex]";
		A[maxindex]=A[i-1];
		A[i-1]=temp;
	}
}
main_program{
	int n;
	cin>>n;
	char A[n][12]; 
	for(int i=0;i<n;i++){
		cin>>A[i];
	}
	string_sort(A,n);
	for(int i=0;i<n;i++){
		cout<<A[i]<<endl;
	}
	cout<<(n*n-n)/2;
	
	
}

Grading criterion: Sort is implemented in function string_sort.
Rating A: If implemented in function
Rating B: If not implemented in function.
Rating C: 0
Rating D: 0
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;
#define MAX 11
void swap( int &a, int &b)
{
	int temp= a;
	a=b;
	b=temp;
}
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;
	else if(first[i]==second[i])
	i++;
	}

}
int determination(char s[][MAX], int n, int &ctr1)
{
	int indi; int index=0;
	for(int i=0; i<n-1;i++)
	{
		
	indi= string_compare(s[i],s[i+1]);
	ctr1++;
	if(indi==1)
		index++;
	}
	return index;
}
void string_sort( char s[][MAX], int n,int &ctr1,int &ctr2)
{ 
	for(int i=n-1;i>0;i--)
	{
		int index= determination(s,n,ctr1);// minimum index
		if(index!=i)
		{
			swap(s[index],s[i]);
			ctr2++;
		}
	}
}
int main()
{	
	int n; int ctr1=0;//number of times compare is called
	int ctr2=0;// the number of times swapped
	cin>>n;
	char s[n][MAX];
	for(int i=0;i<n;i++)
	{
		cin>>s[i];
	}
	string_sort(s,n,ctr1,ctr2);
	for(int i=0;i<n;i++)
	{
		cout<<s[i]<<endl;
	}
	cout<<ctr1<<endl<<ctr2;
	//number of times compare was called then  swap times
}

Grading criterion: Sort is implemented in function string_sort.
Rating A: If implemented in function
Rating B: If not implemented in function.
Rating C: 0
Rating D: 0
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;
void input(int n,char arr[][12]){

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

cin>>arr[i][12];

}
}

int main() {

int n;cin>>n;
char arr[n][12];

input(n,arr);

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

cout<<arr[i][12];
}


}

Grading criterion: Sort is implemented in function string_sort.
Rating A: If implemented in function
Rating B: If not implemented in function.
Rating C: 0
Rating D: 0
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;
void copy(char *s, char *t)
{
	while (*s++ = *t++); 
}
void swap(char *s,char *t)
{
	char *temp;
	copy(temp,s);
	copy(s,t);
	copy(t,temp);
}
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++;
	}
}
int s1(char str[][], int l)
{
	int m=0;
	for(int j=1;j<l;j++)
	{
		if(string_compare(str[m],str[j]== 1){m=j;break;}
	}
	return m;
}
void sort(char str[][],int n)
{
	for(int i=n; i>1;i--)	
	{
		int m=s1(str,i);
		swap(&str[m],&str[i-1]);
	}
}
int main()
{
	int n;
	cin>>n;
	char string_2d[11][n];
	for(int i=0;i<n;i++)
	{
		cin>>string_2d[i];
	}
	sort(string_2d,n);
}

Grading criterion: Sort is implemented in function string_sort.
Rating A: If implemented in function
Rating B: If not implemented in function.
Rating C: 0
Rating D: 0
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 *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++;
}}
void swap (char *a, char *b)
{
    float temp;
    temp = *a;
    *a = *b;
    *b = temp;
    
}

int argmax(char *marks, int L)
{
	int maxindex = 0;
	for(int j=1; j<L; j++){
		// update the index if a larger element is found
		if(marks[maxindex] < marks[j]) maxindex = j;
	}
	return maxindex;
}


void selection_sort (char *data, int n,int* acomp,int* aswp)
{
    for(int i=n; i>1;i--)
    {  
        int maxindex = argmax(data,i);
        *acomp=(i-1)+*acomp;
        // get the maximum of the first i elements
        if(aswp>=0)
        {swap(&data[maxindex],&data[i-1]); *aswp= *aswp+1;}
        
         // refer to earlier slides for this!
        // at this point, data[i-1] will be in the correct position for a sorted array
    }
}

int main()
{
  int n,comp=0,swp=0;
 
  
  cin>>n;
  char arr[n][11];
  for(int i=0;i<n;i++)
  {
    cin>>arr[i];
  }
  selection_sort(arr[11],n,&comp,&swp);
  
  for(int i =n-1;; )
  {if(i<0)break;
    cout<<arr[i]<<endl;
    i--;
    
  }
  cout<<comp<<endl;
  cout<<swp<<endl;
  
  
  

}

Grading criterion: Sort is implemented in function string_sort.
Rating A: If implemented in function
Rating B: If not implemented in function.
Rating C: 0
Rating D: 0
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>
#define MAX 12
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 string_sort(char a[MAX][MAX],char b[MAX][MAX], int m, int& n, int& l){
     l=0;
     n=0;
     for(int i=0; i<m; i++){
          int t=0;
          for(int j=i; j<m-1; j++){
               if(string_compare(a[j], a[j+1])==-1){
                    t=j+1;
                    n++;
               }
          }   
          int k=0;  
               while(a[t][k]!=0){
                    b[i][k]=a[t][k];
                    k++;}
                    b[i][k]=0;
               if(i!=t){
                    l++;     
          }          
          
     }
}
int main(){
     int m;
     cin >> m;
     char a[MAX][MAX];
     char b[MAX][MAX];
     for(int i=0; i<=m; i++){
          cin.getline(a[i],12);
     }
     int l;
     int n;
     string_sort(a, b, m, n, l);     
     for(int i=0; i<=m; i++){
          cout << b[i] << endl;
     } 
     cout << n << endl << l;
}

Grading criterion: Sort is implemented in function string_sort.
Rating A: If implemented in function
Rating B: If not implemented in function.
Rating C: 0
Rating D: 0
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 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 minindex(char *a,int l)
{
int mini=0;
for (int j=1;j++;j<l)
{
    if (string_compare(a[j],a[mini])==1) mini=j;
}
return mini;
}


int string_sort(char *a, int n)
{
int c2=0;
for (int i=n;i>1;i--)
{    
    int mini=minindex(a,n);
    int temp=a[i-1];
    a[i-1]=a[mini];
    a[mini]=temp;
    c2+=1;
}
return c2;
}
    


int main()
{
int n;
cin>>n;
char arr[n][11];
for (int i=0;i<n;i++)
{    
    cin>>arr[i];
}
k2=string_sort(arr,n);
for (int i=0;i<n;i++)
{
    cout<<arr[i]<<endl;
}
cout<<k2;
cout<<k2;


}

Grading criterion: Sort is implemented in function string_sort.
Rating A: If implemented in function
Rating B: If not implemented in function.
Rating C: 0
Rating D: 0
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;

void swap(char * &a, char * &b)
{ int temp=a;
a=b;
b=temp;
} 

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

void stringsort(char b[][13],int n)
{
int k=string_compare;
for(int j=0; j<13; j++)
{
for(int i=0; i<n; i++)
{
 if(k=-1) swap(b[][i],b[][i+1]);

}
}}
int main()
{
int n;
cin>>n;
char a[n+1][13];
int count=0;
while(cin.getline(a[count++],13));
stringsort(a,n);
for(int j=0; j<13; j++)
{
for(int i=0; i<n; i++)
{
cout<<a[i][j];
}}
}

Grading criterion: Sort is implemented in function string_sort.
Rating A: If implemented in function
Rating B: If not implemented in function.
Rating C: 0
Rating D: 0
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 *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(){
	char x[100]; 
	cin.getline(x,n);

}

Grading criterion: Sort is implemented in function string_sort.
Rating A: If implemented in function
Rating B: If not implemented in function.
Rating C: 0
Rating D: 0
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>

void swap (float *a, float *b)
{
    float temp;
    temp = *a;
    *a = *b;
    *b = temp;
}

int argmax (float *marks, int L)
{
	int maxindex = 0;
	for(int j=1; j<L; j++){
			if(marks[maxindex] < marks[j]) maxindex = j;
	}
	return maxindex;
}


void selection_sort (float *data, int n)
{
    for(int i=n; i>1;i--)
    {
        int maxindex = argmax(data,i); 
        swap(&data[maxindex],&data[i-1]); 
           }
}


main_program
{
    float A[100];
    int i,n;
    cin >> n;

    for (i= 0; i < n; i++)
    {
        
        cin >> A[i];
    }
    for (i= 0; i < n-1; i++)
    {
        cout << "uppercase"<<endl;
    }


    selection_sort(A,n);
    
    for (i= 0; i < n-1; i++)
    {
        cout << "lowercase"<<endl;
		cout<<1<< endl<<1;
}
    }

Grading criterion: Sort is implemented in function string_sort.
Rating A: If implemented in function
Rating B: If not implemented in function.
Rating C: 0
Rating D: 0
Assigned grade: B