CodeGraderBench/CodeGraderBench huggingface dataset:
Problem: Write a C++ program to sort an array A of n numbers strictly using the given algorithm:

1. Find the minimum element in the array.
2. Swap the minimum element with the first element of the array.
3. Find the minimum element in the remaining array.
4. Swap the minimum element with the second element of the array.
5. Repeat steps 3 and 4 until the entire array is sorted.

Constraints:

* n < 25

Input Format:

* Non-negative integer n
* Array A of n elements

Output Format:

* Print the sorted array with a space between adjacent elements.

Student submission:
#include <iostream>

using namespace std ;

int sort(int n , int arr[]){
int p=99999 ;

for (int f=0 ; f<n ; f++){
        for(int w=f ; w<n ; w++){
        int a=min(p,arr[w]) ;
        int b=arr[f] ;
        int temp = b ; b=a ; a=temp ; } 
        
        return arr[f] ;
  }
 
  
  return 0 ; } 
 
      
 
 int main(){

int n ;
cin >> n ;

int arr[n] ;

for(int i=0 ; i<n ; i++) {
     cin >> arr[i] ; }
     
     cout<< sort(n, arr) ;
    
    
    }

Grading criterion: Placeholder for extra marks to be given for any reason
Rating A: Modularity, Extra Functions Defined, some corrective marks for failed testcases
Rating B: No reason for extra marks
Rating C: 0
Rating D: 0
Assigned grade: B
Problem: Write a C++ program to sort an array A of n numbers strictly using the given algorithm:

1. Find the minimum element in the array.
2. Swap the minimum element with the first element of the array.
3. Find the minimum element in the remaining array.
4. Swap the minimum element with the second element of the array.
5. Repeat steps 3 and 4 until the entire array is sorted.

Constraints:

* n < 25

Input Format:

* Non-negative integer n
* Array A of n elements

Output Format:

* Print the sorted array with a space between adjacent elements.

Student submission:
#include<iostream>

using namespace std;

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

  int array[n];
  
  for(int i=0;i<=n;i++){
    cin>>array[i];
  }
   for(int i=0;i<=n;i++){
   cout<<array[i]<<" ";
 }   
    
    
    
    return 0;
      
     
    
    }

Grading criterion: Placeholder for extra marks to be given for any reason
Rating A: Modularity, Extra Functions Defined, some corrective marks for failed testcases
Rating B: No reason for extra marks
Rating C: 0
Rating D: 0
Assigned grade: B
Problem: Write a C++ program to sort an array A of n numbers strictly using the given algorithm:

1. Find the minimum element in the array.
2. Swap the minimum element with the first element of the array.
3. Find the minimum element in the remaining array.
4. Swap the minimum element with the second element of the array.
5. Repeat steps 3 and 4 until the entire array is sorted.

Constraints:

* n < 25

Input Format:

* Non-negative integer n
* Array A of n elements

Output Format:

* Print the sorted array with a space between adjacent elements.

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

void swap(int a,int b){
a=a+b;
b=a-b;
a=a-b;
return;
}

int main()
{
int arr[n],a,b,min;
cin>>n;
cin>>b;
arr[0]=b;
for(a=1; a<n; a++)
{
cin>>arr[a];
if(b>arr[a]){
min=arr[a];
b=arr[a]+b;
arr[a]=b-arr[a];
b=b-arr[a];

}
}
cout<<min;
}

Grading criterion: Placeholder for extra marks to be given for any reason
Rating A: Modularity, Extra Functions Defined, some corrective marks for failed testcases
Rating B: No reason for extra marks
Rating C: 0
Rating D: 0
Assigned grade: B
Problem: Write a C++ program to sort an array A of n numbers strictly using the given algorithm:

1. Find the minimum element in the array.
2. Swap the minimum element with the first element of the array.
3. Find the minimum element in the remaining array.
4. Swap the minimum element with the second element of the array.
5. Repeat steps 3 and 4 until the entire array is sorted.

Constraints:

* n < 25

Input Format:

* Non-negative integer n
* Array A of n elements

Output Format:

* Print the sorted array with a space between adjacent elements.

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


int main(){

int n=0;
cin>>n;
int A[n];

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

cout<<A;

for(int i=0; i<n;i++){
	if(A[i]>A[i+1]){
	int temp=A[i+1];
	A[i+1]=A[i];
	A[i]=temp;
	return A[n];
}

}
cout<<A;
return 0;
}

Grading criterion: Placeholder for extra marks to be given for any reason
Rating A: Modularity, Extra Functions Defined, some corrective marks for failed testcases
Rating B: No reason for extra marks
Rating C: 0
Rating D: 0
Assigned grade: B
Problem: Write a C++ program to sort an array A of n numbers strictly using the given algorithm:

1. Find the minimum element in the array.
2. Swap the minimum element with the first element of the array.
3. Find the minimum element in the remaining array.
4. Swap the minimum element with the second element of the array.
5. Repeat steps 3 and 4 until the entire array is sorted.

Constraints:

* n < 25

Input Format:

* Non-negative integer n
* Array A of n elements

Output Format:

* Print the sorted array with a space between adjacent elements.

Student submission:
#include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
int a[n];
for (int i=0;i<n;i++){
cin>>a[i];}
int mi;

for(int i=0;i<n;i++){
mi=i;
for (int j=i+1;j<n;j++){
if(a[j]<a[mi]) mi=j;}
int mktemp=a[i];
a[i]=a[mi];
a[mi]=mktemp;}

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

Grading criterion: Placeholder for extra marks to be given for any reason
Rating A: Modularity, Extra Functions Defined, some corrective marks for failed testcases
Rating B: No reason for extra marks
Rating C: 0
Rating D: 0
Assigned grade: B
Problem: Write a C++ program to sort an array A of n numbers strictly using the given algorithm:

1. Find the minimum element in the array.
2. Swap the minimum element with the first element of the array.
3. Find the minimum element in the remaining array.
4. Swap the minimum element with the second element of the array.
5. Repeat steps 3 and 4 until the entire array is sorted.

Constraints:

* n < 25

Input Format:

* Non-negative integer n
* Array A of n elements

Output Format:

* Print the sorted array with a space between adjacent elements.

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

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

int main()
{
 int n;
 cin>>n;
 int a[n];
 for(int i=0;i<n;i++)cin>>a[i];
 if(n<25){
 for(int i=0;i<n;i++)
 {int j;
  j=i;
   while(a[j-1]>a[j] && j>0){
     swap(&a[j-1],&a[j]);
     j=j-1;}
}
for(int i=0;i<n;i++)cout<<a[i]<<" ";
}
}

Grading criterion: Placeholder for extra marks to be given for any reason
Rating A: Modularity, Extra Functions Defined, some corrective marks for failed testcases
Rating B: No reason for extra marks
Rating C: 0
Rating D: 0
Assigned grade: B
Problem: Write a C++ program to sort an array A of n numbers strictly using the given algorithm:

1. Find the minimum element in the array.
2. Swap the minimum element with the first element of the array.
3. Find the minimum element in the remaining array.
4. Swap the minimum element with the second element of the array.
5. Repeat steps 3 and 4 until the entire array is sorted.

Constraints:

* n < 25

Input Format:

* Non-negative integer n
* Array A of n elements

Output Format:

* Print the sorted array with a space between adjacent elements.

Student submission:
#include <iostream>


using namespace std;

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

	int a[n];
	int i;

	for(i=0; i<n; i++)
	cin>>a[i];

	int j;
	int k;


	for(j=0; j<n; j++){
	int minindex=j;

	for (k=j; k<n; k++)
	{
		if(a[k]<a[minindex])
		minindex=k;

	}
	int temp=a[j];
	a[j]=a[minindex];
	a[minindex]=temp;
	}

	for(i=0; i<(n-1); i++)
	cout<<a[i]<<" ";
	cout<<a[n-1];

}

Grading criterion: Placeholder for extra marks to be given for any reason
Rating A: Modularity, Extra Functions Defined, some corrective marks for failed testcases
Rating B: No reason for extra marks
Rating C: 0
Rating D: 0
Assigned grade: B
Problem: Write a C++ program to sort an array A of n numbers strictly using the given algorithm:

1. Find the minimum element in the array.
2. Swap the minimum element with the first element of the array.
3. Find the minimum element in the remaining array.
4. Swap the minimum element with the second element of the array.
5. Repeat steps 3 and 4 until the entire array is sorted.

Constraints:

* n < 25

Input Format:

* Non-negative integer n
* Array A of n elements

Output Format:

* Print the sorted array with a space between adjacent elements.

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

int swap(int &a,int  &b)
{
int temp;
temp=a;
a=b;
b=temp;

return (a, b);
}

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

int A[n];
int m=A[0];

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

for (int i=0; i<n; i++)
{
	for (int  j=0; j<i; j++)
	{
		if (A[j]>A[i])
		{
			swap(A[j], A[i]);
		}
	}	
}

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

Grading criterion: Placeholder for extra marks to be given for any reason
Rating A: Modularity, Extra Functions Defined, some corrective marks for failed testcases
Rating B: No reason for extra marks
Rating C: 0
Rating D: 0
Assigned grade: B
Problem: Write a C++ program to sort an array A of n numbers strictly using the given algorithm:

1. Find the minimum element in the array.
2. Swap the minimum element with the first element of the array.
3. Find the minimum element in the remaining array.
4. Swap the minimum element with the second element of the array.
5. Repeat steps 3 and 4 until the entire array is sorted.

Constraints:

* n < 25

Input Format:

* Non-negative integer n
* Array A of n elements

Output Format:

* Print the sorted array with a space between adjacent elements.

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

int main(){
 int n,a[25],i,j;
 cin >> n;
 for(i=0;i<n;i++){ cin >> a[i];}
 for(i=0;i<n;i++){
   for(j=i;j<n;j++){
        if(a[i] > a[j]){
           int temp = a[i];
           a[i] = a[j];
           a[j] = temp;
           }
        }
      cout << a[i] << " ";
    }
  }

Grading criterion: Placeholder for extra marks to be given for any reason
Rating A: Modularity, Extra Functions Defined, some corrective marks for failed testcases
Rating B: No reason for extra marks
Rating C: 0
Rating D: 0
Assigned grade: B
Problem: Write a C++ program to sort an array A of n numbers strictly using the given algorithm:

1. Find the minimum element in the array.
2. Swap the minimum element with the first element of the array.
3. Find the minimum element in the remaining array.
4. Swap the minimum element with the second element of the array.
5. Repeat steps 3 and 4 until the entire array is sorted.

Constraints:

* n < 25

Input Format:

* Non-negative integer n
* Array A of n elements

Output Format:

* Print the sorted array with a space between adjacent elements.

Student submission:
#include<simplecpp>

using namespace std;

int minindex1(int *arr, int w, int n){
	int minindex = w;
	for(int i = w; i<n; i++){
		if(arr[i]<arr[minindex])minindex = i;
	}
	return minindex;
}

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

main_program{
	int n, arr[1000];
	cin>>n;
	for(int i = 0; i<n; i++)cin>>arr[i];
	for(int i = 0; i<n-1; i++){
		int k = minindex1(arr,i,n);
		swap(arr[i],arr[k]);
	}
	for(int i = 0 ; i<n; i++)cout<<arr[i]<<" ";
}

Grading criterion: Placeholder for extra marks to be given for any reason
Rating A: Modularity, Extra Functions Defined, some corrective marks for failed testcases
Rating B: No reason for extra marks
Rating C: 0
Rating D: 0
Assigned grade: A
Problem: Write a C++ program to sort an array A of n numbers strictly using the given algorithm:

1. Find the minimum element in the array.
2. Swap the minimum element with the first element of the array.
3. Find the minimum element in the remaining array.
4. Swap the minimum element with the second element of the array.
5. Repeat steps 3 and 4 until the entire array is sorted.

Constraints:

* n < 25

Input Format:

* Non-negative integer n
* Array A of n elements

Output Format:

* Print the sorted array with a space between adjacent elements.

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

void swap(int *a,int *b){
   int temp;
   temp=*a;
   *a=*b;
   *b=temp;}
   
int main(){
int *A;
int n;

cin>>n;
for(int l=0;l<n;l++){ cin>>A[l];}
for(int j=0;j<n;j++){
    
    for(int i=0;i<n;i++){
       int min=j;
                      if(A[min]<A[i]){ min=i;}
                      swap(A[j],A[min]);}
                     } 
                     
for(int k=0;k<n;k++){ cout<<A[k]<<" ";}
}

Grading criterion: Placeholder for extra marks to be given for any reason
Rating A: Modularity, Extra Functions Defined, some corrective marks for failed testcases
Rating B: No reason for extra marks
Rating C: 0
Rating D: 0
Assigned grade: B
Problem: Write a C++ program to sort an array A of n numbers strictly using the given algorithm:

1. Find the minimum element in the array.
2. Swap the minimum element with the first element of the array.
3. Find the minimum element in the remaining array.
4. Swap the minimum element with the second element of the array.
5. Repeat steps 3 and 4 until the entire array is sorted.

Constraints:

* n < 25

Input Format:

* Non-negative integer n
* Array A of n elements

Output Format:

* Print the sorted array with a space between adjacent elements.

Student submission:
#include<iostream>
using namespace std;
/*int minimum(int*arr,int n){
	int minindex=0;
	for(int i=0;i<n;i++){
		if(arr[minindex]>arr[i]){
			minindex=i;
		}
	}
	return minindex;
}*/
void selectionsort(int *arr,int n){
	int a=0;
	int minindex=0;
	for(int i=0;i<n-1;i++){
		minindex=i;
		for(int j=i+1;j<n;j++){
			if(arr[j]<arr[minindex]){
				minindex=j;
			}
		}
		int temp=arr[i];
		arr[i]=arr[minindex];
		arr[minindex]=temp;
	}

}
int main(){
	int n;
	cin>>n;
	int arr[n];
	for(int i=0;i<n;i++){
		cin>>arr[i];
	}
	selectionsort(arr,n);
	for(int i=0;i<n;i++){
		cout<<arr[i]<<" ";
	}
}

Grading criterion: Placeholder for extra marks to be given for any reason
Rating A: Modularity, Extra Functions Defined, some corrective marks for failed testcases
Rating B: No reason for extra marks
Rating C: 0
Rating D: 0
Assigned grade: B
Problem: Write a C++ program to sort an array A of n numbers strictly using the given algorithm:

1. Find the minimum element in the array.
2. Swap the minimum element with the first element of the array.
3. Find the minimum element in the remaining array.
4. Swap the minimum element with the second element of the array.
5. Repeat steps 3 and 4 until the entire array is sorted.

Constraints:

* n < 25

Input Format:

* Non-negative integer n
* Array A of n elements

Output Format:

* Print the sorted array with a space between adjacent elements.

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

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

int argmin(int *A,int n){
 int minimum=0;
 for(int i=1;i<n;i++){
   if(A[minimum]>A[i]) minimum=i;
 }
 return minimum;}


int sorting(int *A,int n){
  
      for(int j=0;j<n;j++){
	
    swap(&A[j],&A[minimum])}




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

	  sorting(A,n);
	}

Grading criterion: Placeholder for extra marks to be given for any reason
Rating A: Modularity, Extra Functions Defined, some corrective marks for failed testcases
Rating B: No reason for extra marks
Rating C: 0
Rating D: 0
Assigned grade: B
Problem: Write a C++ program to sort an array A of n numbers strictly using the given algorithm:

1. Find the minimum element in the array.
2. Swap the minimum element with the first element of the array.
3. Find the minimum element in the remaining array.
4. Swap the minimum element with the second element of the array.
5. Repeat steps 3 and 4 until the entire array is sorted.

Constraints:

* n < 25

Input Format:

* Non-negative integer n
* Array A of n elements

Output Format:

* Print the sorted array with a space between adjacent elements.

Student submission:
#include<simplecpp>

int argmin (float *A, int i, int n){
	int minindex = i;
	for(int j=i; j<n; j++){
		if(A[minindex] > A[j]) minindex = j;
	}
	return minindex;
}

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

void selection_sort (float *A, int n){
	for(int i=0; i<n;i++){
		int minindex = argmin(A,i,n);
		myswap(&A[minindex],&A[i]);
	}
}

main_program {
	int n;
	cin >> n;
	float A[n];
	for (int i = 0; i < n; i++) {
		cin >> A[i];
	}
	selection_sort(A, n);
	for (int i = 0; i < n; i++) {
		cout << A[i] << " ";
	}
}

Grading criterion: Placeholder for extra marks to be given for any reason
Rating A: Modularity, Extra Functions Defined, some corrective marks for failed testcases
Rating B: No reason for extra marks
Rating C: 0
Rating D: 0
Assigned grade: A
Problem: Write a C++ program to sort an array A of n numbers strictly using the given algorithm:

1. Find the minimum element in the array.
2. Swap the minimum element with the first element of the array.
3. Find the minimum element in the remaining array.
4. Swap the minimum element with the second element of the array.
5. Repeat steps 3 and 4 until the entire array is sorted.

Constraints:

* n < 25

Input Format:

* Non-negative integer n
* Array A of n elements

Output Format:

* Print the sorted array with a space between adjacent elements.

Student submission:
#include<iostream> 
using namespace std;
void swap(int*x, int*y){
	int*temp=x;
	x=y;
	y=temp; }
	
int main() {
int n; cin>>n;
int A[n];
for(int i=0;i<n;i++) cin>>A[i];

for(int j=0;j<n;j++){ 
	int min=j;
	for(int i=j+1; i<n;i++) if( A[i]< A[min]) min=i;
swap(A[j], A[min]);
}

for(int i=0;i<n;i++) cout<<A[i]<<" ";
return 0;
}

Grading criterion: Placeholder for extra marks to be given for any reason
Rating A: Modularity, Extra Functions Defined, some corrective marks for failed testcases
Rating B: No reason for extra marks
Rating C: 0
Rating D: 0
Assigned grade: B
Problem: Write a C++ program to sort an array A of n numbers strictly using the given algorithm:

1. Find the minimum element in the array.
2. Swap the minimum element with the first element of the array.
3. Find the minimum element in the remaining array.
4. Swap the minimum element with the second element of the array.
5. Repeat steps 3 and 4 until the entire array is sorted.

Constraints:

* n < 25

Input Format:

* Non-negative integer n
* Array A of n elements

Output Format:

* Print the sorted array with a space between adjacent elements.

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

void myswap(int &a, int &b)
{
	int temp = a;
	a = b;
	b = temp;
}

int minindex(int *a, int n)
{
	int minindex = 0;
	for(int i = 1; i<n; i++)
	{
		if(a[i] < a[minindex]) minindex = i;
	}
	return minindex;
}

int main ()
{
	int n;
	cin >> n;
	int a[n];
	for(int i=0; i<n; i++) cin >> a[i];
	
	for(int i=0; i<n-1; i++)
	{
		int minin = minindex(a+i, n-i);
		myswap(a[i], a[minin+i]);
	}
	
	for(int i=0; i<n-1; i++) cout << a[i] << " ";
	cout << a[n-1];
}

Grading criterion: Placeholder for extra marks to be given for any reason
Rating A: Modularity, Extra Functions Defined, some corrective marks for failed testcases
Rating B: No reason for extra marks
Rating C: 0
Rating D: 0
Assigned grade: A
Problem: Write a C++ program to sort an array A of n numbers strictly using the given algorithm:

1. Find the minimum element in the array.
2. Swap the minimum element with the first element of the array.
3. Find the minimum element in the remaining array.
4. Swap the minimum element with the second element of the array.
5. Repeat steps 3 and 4 until the entire array is sorted.

Constraints:

* n < 25

Input Format:

* Non-negative integer n
* Array A of n elements

Output Format:

* Print the sorted array with a space between adjacent elements.

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

int main(){
int n,k=0;
cin>>n;
int A[n];
for (int i=0;i<n;i++){cin>>A[i];}
for(int i=0;i<n;i++){
for(int j=i;j<n;j++)
{  if(j!=i){if(A[i]<A[j]){k++;}}
      if(k==n-i-1){swap(A[0],A[i]);}}
      k=0;}
for(int i=0;i<n;i++){cout<<A[i]<<" ";}
}

Grading criterion: Placeholder for extra marks to be given for any reason
Rating A: Modularity, Extra Functions Defined, some corrective marks for failed testcases
Rating B: No reason for extra marks
Rating C: 0
Rating D: 0
Assigned grade: B
Problem: Write a C++ program to sort an array A of n numbers strictly using the given algorithm:

1. Find the minimum element in the array.
2. Swap the minimum element with the first element of the array.
3. Find the minimum element in the remaining array.
4. Swap the minimum element with the second element of the array.
5. Repeat steps 3 and 4 until the entire array is sorted.

Constraints:

* n < 25

Input Format:

* Non-negative integer n
* Array A of n elements

Output Format:

* Print the sorted array with a space between adjacent elements.

Student submission:
#include<simplecpp>
void swap(double &x,double &y)
	{
	  double temp;
	  temp=x;x=y;y=temp;
	}
int minindex(double *A,int i,int n)
	{
	  int minindex=i;
	  for(int j=i+1;j<n;j++)
	    {
	       if(A[minindex]>A[j])
	            minindex=j;
	    }
	  return minindex;
	}	
main_program
{
   int n;
   double A[1000];
   cin>>n;
   for(int i=0;i<n;i++)
       cin>>A[i];
   for(int i=0;i<n;i++)
   	{
          swap(A[i],A[minindex(A,i,n)]);
   	}
   for(int i=0;i<n;i++)
      cout<<A[i]<<" ";
}

Grading criterion: Placeholder for extra marks to be given for any reason
Rating A: Modularity, Extra Functions Defined, some corrective marks for failed testcases
Rating B: No reason for extra marks
Rating C: 0
Rating D: 0
Assigned grade: B
Problem: Write a C++ program to sort an array A of n numbers strictly using the given algorithm:

1. Find the minimum element in the array.
2. Swap the minimum element with the first element of the array.
3. Find the minimum element in the remaining array.
4. Swap the minimum element with the second element of the array.
5. Repeat steps 3 and 4 until the entire array is sorted.

Constraints:

* n < 25

Input Format:

* Non-negative integer n
* Array A of n elements

Output Format:

* Print the sorted array with a space between adjacent elements.

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


int main()
{
   int n,i,c,j,k,min,temp,l;
   cin>>n;
   int a[n];
   for(i=0;i<n;i++)
   {
      cin>>a[i];
   }
  
   
   
   for(j=0;j<n;j++)
   {
      
      for(k=j;k<n;k++)
      {
        if(a[k]<a[j])
        {
        min=a[k];
        c=k;
        
        }
        
      }
      
      temp=a[c];
      a[c]=a[j];
      a[j]=temp;
      
      }
      
      for(l=0;l<n;l++)
      {
       cout<<a[l]<<" ";
   
      }
      }

Grading criterion: Placeholder for extra marks to be given for any reason
Rating A: Modularity, Extra Functions Defined, some corrective marks for failed testcases
Rating B: No reason for extra marks
Rating C: 0
Rating D: 0
Assigned grade: B
Problem: Write a C++ program to sort an array A of n numbers strictly using the given algorithm:

1. Find the minimum element in the array.
2. Swap the minimum element with the first element of the array.
3. Find the minimum element in the remaining array.
4. Swap the minimum element with the second element of the array.
5. Repeat steps 3 and 4 until the entire array is sorted.

Constraints:

* n < 25

Input Format:

* Non-negative integer n
* Array A of n elements

Output Format:

* Print the sorted array with a space between adjacent elements.

Student submission:
#include<iostream>
using namespace std;
int main(){
int n;
cin>>n;
int A[n];
for(int i=0;i<n;i++){
cin>>A[i];
}
for(int i=0;i<n-1;i++)
{
  for(int j=i+1;j<n;j++)
  {
      if(A[i]>A[j])
      {
        int k=A[i];
        A[i]=A[j];
        A[j]=k;
       }
  }
}
for(int i=0;i<n;i++)
cout<<A[i]<<" ";
}

Grading criterion: Placeholder for extra marks to be given for any reason
Rating A: Modularity, Extra Functions Defined, some corrective marks for failed testcases
Rating B: No reason for extra marks
Rating C: 0
Rating D: 0
Assigned grade: B