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:

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. Do not use the inbuilt strcmp function.
A function string_sort which sorts the character strings using the mergesort algorithm taught in class. You are recommended to write a recursive implementation. You will automatically lose 50% of the marks for this program if you implemented the sorting within main.
Your program should then print out the strings in sorted alphabetical order, starting from the first to the last. Feel free to refer to the lecture slides for help.

Input Format
integer n, and a set of n character strings


Output Format
Print out the strings in the suggested order, one string on a new line


Constraints
n is a positive integer, n <= 15
For ease of display of the output, the maximum length of any of the strings should be 11, excluding the NULL character
The character strings should contain only lower case alphabets


Sample input and output




Input

Output

4

zebra

lion

tiger

monkey



lion

monkey

tiger

zebra







Note:  

Do not write any C++ statements for printing general messages. For example, the following should NOT be present in your program: 
cout << "Enter a number:",  
cout << "The computed answer is", etc.  


cout should be used to print only the computed final output. In addition, do not print unnecessary spaces unless specified in the program.

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 merge(char coll[][15],char B1[][15], char B2[][15], int n1, int n2){
int cB1, cB2, cA; cB1 = cB2 = cA = 0; 
while (cB1 < n1 && cB2 < n2){
	if (string_compare(B1[cB1],B2[cB2])==1){int r5=0; while(B1[cB1][r5]!=0){coll[cA][r5]=B1[cB1][r5]; r5=r5+1;} 
                                            coll[cA][r5]=0;
                                            cA=cA+1;cB1=cB1+1;
    } 
    
	else if (string_compare(B1[cB1],B2[cB2])==-1){int r5=0; while(B2[cB2][r5]!=0){coll[cA][r5]=B2[cB2][r5]; r5=r5+1;} 
                                                  coll[cA][r5]=0;  
                                            cA=cA+1;cB2=cB2+1;
    } 
     
	else {int r5=0; while(B1[cB1][r5]!=0){coll[cA][r5]=B1[cB1][r5]; r5=r5+1;} 
                                            coll[cA][r5]=0;
                                            cA=cA+1;cB1=cB1+1;
          int r6=0; while(B2[cB2][r6]!=0){coll[cA][r6]=B2[cB2][r6]; r6=r6+1;} 
                                            coll[cA][r6]=0;
                                            cA=cA+1;cB2=cB2+1;                                  
         } 
}
while(cB1 < n1) {int r5=0; while(B1[cB1][r5]!=0){coll[cA][r5]=B1[cB1][r5]; r5=r5+1;} 
                                                 coll[cA][r5]=0; 
                                            cA=cA+1;cB1=cB1+1;}
while(cB2 < n2) {int r6=0; while(B2[cB2][r6]!=0){coll[cA][r6]=B2[cB2][r6]; r6=r6+1;} 
                                           coll[cA][r6]=0;
                                            cA=cA+1;cB2=cB2+1; }

}
void mergesort (char coll[][15], int n){
if (n > 1){
		char B1[n/2][15], B2[n-n/2][15]; 
for (int i=0;i<n/2;i++) { int r5=0; while(coll[i][r5]!=0){B1[i][r5]=coll[i][r5]; r5=r5+1;} B1[i][r5]=0;}
for (int i=n/2;i<n;i++) { int r6=0; while(coll[i][r6]!=0){B2[i][r6]=coll[i][r6]; r6=r6+1;} B2[i][r6]=0;}

	mergesort(B1,n/2); mergesort (B2,n-n/2);
		merge(coll,B1,B2,n/2,n-n/2);}
}


int main(){
int n; cin>>n;
char coll[n][15];
for(int r1=0;r1<n;r1=r1+1){cin>>coll[r1];}
mergesort(coll,n);
for(int r3=0;r3<n;r3=r3+1){
                           int r4=0;
                           while(coll[r3][r4]!=0){
                                                     cout<<coll[r3][r4];
                                                     r4=r4+1; 
                                                      }
                           cout<<endl;
                           }
}

Grading criterion: Placeholder for extra marks to be given for any reason
Rating A: Implemented merge sort recursively, 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