#include //TO FIND THE RANK OF A WORD WHICH HAS DISTINCT LETTERS ONLY. (NO REPEATING LETTERS) using namespace std; void arrangealphabetically(char a[], char b[]) { char temp =0; char temp1 =0; for(int i =0; a[i]!= '\0';i++) { if(a[i]>=65 && a[i]<=90) //I am giving the user the liberty to enter a word where all the letters are either upper case or lowercase. { for(int j = i+1;a[j]!= '\0';j++) { if( a[j]=97 && a[i]<=122) { for(int j = i+1;a[j]!= '\0';j++) { if( a[j]=65 && b[i]<=90) || (b[i]>=97 && b[i]<=122)) { number++; //This part finds the length of the string } } int r =0; for(int i =0; a[i]!='\0';i++) // This part compares arrays a and b // a is the original array and b is the array where the alphabets are written in alphabetical order { for(int j =0;b[j] != '\0';j++) // j is the loop for b string { if(b[j]!= a[i]) // Lets say the string given by the user is a- |L|I|F|T| . So first we arrange it is alphabetical order, b- |F|I|L|T|. Now first letter of array a, i,e L is compared to letts of b while they arent equal. That means, only L-F,L-I will be compared { int count =1; int c =1; for(int k = 0;b[k]!= '\0';k++) // This part of the program compares first letter of array b with all the OTHER letters(excluding that letter) and each time it finds a different letter with the help of count, we find the factorial. { if(b[k] != b[j]) { c*=count; count++; //factorial } } r += c; } if(b[j]==a[i]) // Remember i mentioned only L-F, L-I will be compared? This is because 3rd letter of array b is L, which means we should lock L since L is the first letter of the word whose rank is what we are concerned , In c++, we can't lock letters directly. So i am deleting that letter. How? By swapping that letter with the last letter and decreasing the size of the array. This is were the length of the string comes into picture { char temp = 0; temp = b[j]; b[j] = b[number - 1]; // deletes b [j] b[number - 1] = temp; number --; } } } return r; } int main() { char a[100]; char b[100];int x =0; cout<<"Enter the string"<

Rank of a string (not working)