What is my mistake

#1


HERE IS MY CODE

#2

hi @hhiteshbansal_40d12e2460a1738e

refer this -->

#include <iostream>
#include <algorithm>
using namespace std;


int compareTo(string s1, string s2) {

        int i = 0;      

        while (i < s1.length() && i < s2.length()) {

            if (s1[i] > s2[i]) {

                return 1;
            } else if (s1[i] < s2[i]) {
                return -1;
            }
            i++;

        }

        if (s1.length() > s2.length()) {
            return -1;
        } else {
            return 1;
        }

    }
void sortfunc(string arr[], int n) {

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

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

                if (compareTo(arr[j], arr[j + 1]) > 0) {

                    string temp = arr[j];
                    arr[j] = arr[j + 1];
                    arr[j + 1] = temp;
                }

            }
        }

    }

int main() 
{

    int n;
    cin>>n;
    string* str = new string[n];
    cin.ignore();
    for(int i=0;i<n;i++)
    {   
        cin>>str[i];
    }
    sortfunc(str, n);
    for(int i=0;i<n;i++)
    {
        cout<<str[i]<<endl;
    }
}
#3

can you please expain sort function and reason of loop j

#4

hi @hhiteshbansal_40d12e2460a1738e
basically we are using comparators for sorting the same…

#5

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.

#6

@hhiteshbansal_40d12e2460a1738e,
what is the issue is the doubt not clear?

#7

@hhiteshbansal_40d12e2460a1738e,
still having doubt may refer to : https://ide.codingblocks.com/s/655949

#8

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.