求一个字符排序算法

[soloxiao]

source:
123
abcd
456
abcdf
abc
789
A
1


结果:
1
123
456
789
A
abc
abcd
abcdf

-------------------
原数据可能有9999组,什么方法最快? 谢谢了！

[soloxiao]

ascii码比较!

[postren]

ascii码比较，用快速排序法

[Could]

随便放在一个容器里面，sort就行了。

[soloxiao]

define ONE_SIZE = 20

我是这样做的:
void quick_sort(unsigned char* x, int low, int high)
{
int i=low, j=high;
//int t=x[low];
unsigned char t[20];
memcpy(t,&x[low*ONE_SIZE],ONE_SIZE);

while (i<j)
{
//while (i<j && x[j]>t)
//while (i<j && x[j*ONE_SIZE]>t[0])
while (i<j && str_cmp(true,&x[j*ONE_SIZE],t,ONE_SIZE))
j--;

// x[i]=x[j];
memcpy(x+i*ONE_SIZE,x+j*ONE_SIZE,ONE_SIZE);


//while (i<j && x[i]<=t)
//while (i<j && x[i*ONE_SIZE]<=t[0])
while (i<j && str_cmp(false,&x[i*ONE_SIZE],t,ONE_SIZE))
i++;

// x[j]=x[i];
memcpy(x+j*ONE_SIZE,x+i*ONE_SIZE,ONE_SIZE);

//x[i] = t;
memcpy(x+i*ONE_SIZE,t,ONE_SIZE);
quick_sort(x,low,i-1); //递归调用此函数
quick_sort(x,i+1,high);
}

我把所有数据放到x里面, 然后定长取出来再比较,
quick_sort(x,0,count);
个数少的时候还行，多了就挂了!

[iamwiner]

你的代码怎么这么乱啊

[popy007]

字典排序：

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iterator>
using namespace std;

bool lexicographer(string& s1, string& s2) {
return lexicographical_compare(s1.begin(), s1.end(),
s2.begin(), s2.end());
}
int main() {
string s[] = {
"123",
"abcd",
"456",
"abcdf",
"abc",
"789",
"A",
"1"};
const int SZ = sizeof s / sizeof *s;
vector<string> vs;
copy(s, s+SZ, back_inserter(vs));
sort(vs.begin(), vs.end(), lexicographer);
copy(vs.begin(), vs.end(), ostream_iterator<string>(cout, "\n"));
return 0;
}

[soloxiao]

顶!

[Torrice]

学习。。。

[北狐狸]

学习

[yinqing_yx]

容器最好~~~~~~`

[shine51151]

学习

[shine51151]

顺便帮顶

[postren]

参考MSDN中的例子：
// crt_qsort.c
// arguments: every good boy deserves favor

/* This program reads the command-line
* parameters and uses qsort to sort them. It
* then displays the sorted arguments.
*/

#include <stdlib.h>
#include <string.h>
#include <stdio.h>

int compare( const void *arg1, const void *arg2 );

int main( int argc, char **argv )
{
int i;
/* Eliminate argv[0] from sort: */
argv++;
argc--;

/* Sort remaining args using Quicksort algorithm: */
qsort( (void *)argv, (size_t)argc, sizeof( char * ), compare );

/* Output sorted list: */
for( i = 0; i < argc; ++i )
printf( " %s", argv[i] );
printf( "\n" );
}

int compare( const void *arg1, const void *arg2 )
{
/* Compare all of both strings: */
return _stricmp( * ( char** ) arg1, * ( char** ) arg2 );
}

[du51]

#include<stdio.h>
#include<stdlib.h>
#include<conio.h>
static int counter=0;
void swap(char **q,int i,int j);
int Mystrcmp(char *str1,char *str2);

void Adjust(char **p,int i,int m)
{
char *temp=p[i];
int j;
for(j=2*i+1;j<=m;j=2*j+1)
{
if(j<m&&Mystrcmp(p[j],p[j+1])<0)j++;
if(Mystrcmp(temp,p[j])>0)break;
p[i]=p[j];
i=j;
}
p[i]=temp;
}

void heapsort(char **q, int n)
{
int m,i;
for(m=n/2;m>-1;m--)
{
Adjust(q,m,n-1);
printf("第%2d次调整后====>",++counter);
for(i=0;i<n;i++)printf("%s ",q[i]);
printf("\n");
}
printf("******以上是初始堆调整******\n");
for(m=n-1;m>0;m--)
{
swap(q,0,m);
Adjust(q,0,m-1);
printf("第%2d次调整后====>",++counter);
for(i=0;i<n;i++)printf("%s ",q[i]);
printf("\n");
}
}
int main()
{
int i,len;
char *list[ ]= {"123","abcd","456","abcdf","abc","789","A","1"};
len=8;
heapsort(list,len);
for(i=0;i<len;i++)printf("%s ",list[i]);
printf("\n");
system("PAUSE");
return 0;
}
void swap(char **q,int i,int j)
{
char *temp=q[i];
q[i]=q[j];
q[j]=temp;
}
int Mystrcmp(char *str1,char *str2)
{
while(*str1&&*str2&&*str1==*str2)str1++,str2++;
return *str1-*str2;
}

[guyanhun]

popy007(Twinsen)

字典排序：

bool lexicographer(string& s1, string& s2) {
return lexicographical_compare(s1.begin(), s1.end(),
s2.begin(), s2.end());
}

————————————————————————————————

支持 ！配合stl 来做。