-
Notifications
You must be signed in to change notification settings - Fork 0
/
SortStringArray.cpp
75 lines (66 loc) · 1.4 KB
/
SortStringArray.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
int comp(const void* a, const void* b)
{
int i=0;
while(*(char*)a+i&&*(char*)b+i){
if(*(char*)a+i==32||*(char*)a+i>*(char*)b+i)
return 1;
else if(*(char*)b+i||*(char*)b+i>*(char*)a+i)
return -1;
i++;
}
if(*(char*)a+i)
return 1;
else if(*(char*)b+i)
return -1;
}
int compr(char a[], char b[])
{
int i=0;
while(*(a+i)&&*(b+i)){
if(*(a+i)==32||*(a+i)>*(b+i))
return 1;
else if(*(b+i)==32||*(b+i)>*(a+i))
return -1;
i++;
}
if(*(a+i))
return 1;
else if(*(b+i))
return -1;
return 0;
}
int main()
{
string str[] = {"nun","NUN","mun"};
string temp;
for(int i = 0; i < 2; ++i)
for( int j = i+1; j < 3; ++j)
{
char a[20];
strcpy(a,str[i].c_str());
char b[20];
strcpy(b,str[j].c_str());
if(compr(a, b)>0)
{
temp = str[i];
str[i] = str[j];
str[j] = temp;
}
}
//qsort(str,10, sizeof(char),comp);
char a[] = "fun";
char b[] = "nun";
int res = compr(a,b);
// cout<<res;
cout << "In lexicographical order: " << endl;
for(int i = 0; i < 3; ++i)
{
cout << str[i] << endl;
}
return 0;
}