Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- int cmp(char a[], char b[])
- {
- int i = N + 1;
- int k = N + 1;
- for (; i >= 0; i--)
- if (a[i]>0)
- break;
- for (; k >= 0; k--)
- if (b[k]>0)
- break;
- if (i < k)
- return -1;
- if (i>k)
- return 1;
- while (a[i] == b[k])
- {
- if (i == 0)
- return 0;
- i--; k--;
- }
- if (a[i] > b[k])
- {
- return 1;
- }
- if (a[i] < b[k])
- {
- return -1;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement