// ~程珠玑 W二?nbsp;字符串string循环UMi?br>// eg "abcdefgh" 循环UM 3?nbsp;=?nbsp;"defghabc"#include<iostream.h>#include <string.h>char* string_cyclicshift_v2( char* string, int i )
{
char ch; int exchange; int len; exchange = 0; len = strlen( string ); i = i%len; if ( 0 == i ) return string; int start_pos=0; while ( exchange<len )
{ char ch = string[start_pos]; int currpos = start_pos; int nextpos = (len+currpos+i)%len; while ( nextpos != start_pos ) { string[currpos] = string[nextpos]; ++exchange; currpos = nextpos; nextpos = (len+currpos+i)%len;
} cout<<string<<endl; string[currpos] = ch; ++exchange; ++start_pos; } return string;}
int main(){
char string[7]={'a','b','h','d','h','s'}; cout<<string<<endl; char* s; s=string_cyclicshift_v2(string,4); cout<<s<<endl;return 0;}
要求旉复杂度空间复杂度都尽可能的低?/p>
旉复杂?OQnQ? I间复杂度OQ?Q，帔R旉?/p>
http://blog.csdn.net/zdl1016/archive/2009/09/21/4575309.aspx
void memcpy(void* pvTo, void* pvFrom, size_t size){ void* pbTo = (byte*)pvTo; void* pbFrom = (byte*)pvFrom; ASSERT(pvTo != NULL && pvFrom != NULL); ASSERT(pbTo>=pbFrom+size || pbFrom>=pbTo+size); while(size-->0) *pbTo++ == *pbFrom++; return(pvTo);
}
]]>
#include <iostream>2
using namespace std;3
4
typedef struct LNode{5
int data;6
struct LNode* next;7
}Linklist;8
9
void disList(Linklist* L){10
Linklist* p=L->next;11
while(p!=NULL){12
cout<<p->data<<" ";13
p=p->next;14
}15
cout<<endl;16
}17
18
void creatList(Linklist *&L,int* a,int n){19
20
Linklist* s;21
int i;22
L=(Linklist*)malloc(sizeof(Linklist));23
L->next=NULL;24
for (i=0;i<n;i++)25
{26
s=(Linklist*)malloc(sizeof(Linklist));27
s->data=a[i];28
s->next=L->next;29
L->next=s;30
}31
}32
33
34
void sort_list(Linklist *&head){35
Linklist *p=head->next,*q,*r;36
if (p!=NULL)37
{38
r=p->next;39
p->next=NULL;40
p=r;41
while(p!=NULL){42
r=p->next;43
q=head;44
while(q->next!=NULL && q->next->data<p->data)45
q=q->next;46
p->next=q->next;47
q->next=p;48
p=r;49
}50
}51
}52
53
int main(){54
Linklist* L;55
L=(Linklist*)malloc(sizeof(Linklist));56
int a[8]={3,34,5,4,32,39,1,0};57
creatList(L,a,8);58
sort_list(L);59
disList(L);60
}
]]>
template<typename T>2
void sort_shell(T* a){3
int d;4
int i;5
int j;6
T temp;7
d=N/2;8
while(d>0){9
for (i=0;i<N-d;i++)10
{11
j=i+d;12
temp=a[j];13
while((j-d)>=0 && temp<a[j-d]){14
a[j]=a[j-d];15
j-=d;16
}17
a[j]=temp;18
19
}20
d=d/2;21
}22
}
]]>