1. | 51cto | | | N.. :47 :0 :72 - http://jeffxie.blog.51cto.com
> | | | | | | Python | C 51CTO51CTO >> C 2010-0 6-11
13:16:45 C [] CC C 120 32 10542 584 920 4 2010-03-18 4 ..
redismemcached.. firefox().. hadoop Hadoopmapreduce HadoopHive
rsync / extern extern out of memoryinclud e*.hstatic main (2)
mainmain
2. newzqy kongy.. 76418.. lovej.. bitte.. seabe.. tomax_li
xiaoyu oklil.. tonyx.. tonyxiaohome.. tonyxiaohome.. tonyxiaohome
.. [] , [][].. roy91074 voidbubble(inta[],intn).. { inti,j,k
for(i=1,ia[j+1]) {Asp.net MVC2 k=a[j]Qtshare..
a[j]=a[j+1]SwingIconSW.. a[j+1]=k }JavaBOM }Log4JAzureAppFabric..
12.. voidsort(inta[],intn)Silverlight & Blend.. {Mysql..
inti,j,k,tWCF4.0.. for(i=0,ia[3][4]a0a+11a[0][1]1&a[1][0]
5. void Input(ST *); void Output(ST *); void Bubble(ST *); void
Find(ST *); void Failure(ST*); /*ST*/ void(*process[5])(ST *)
={Input,Output,Bubble,Find,Failure}; /*process5(*/ printf(
"nChoose:n?" ); scanf( "%d" ,&choice); if
(choice>=0&&choice=0&&choicenext=h/*head*/ h=p
ch++ } returnh }
8. voidoutput(NODE*h) { if(h!=NULL) { output(h->next)
printf("%c",h->data) } } NODE*insert(NODE*h,intx) {
NODE*new,*front,*current=h
while(current!=NULL&&(current->datanext }
new=(NODE*)malloc(sizeof(NODE)) new->data=x new->next=current
if(current==h)/**/ h=new elsefront->next=new returnh }
NODE*delete(NODE*h,intx) { NODE*q,*p=h
while(p!=NULL&&(p->data!=x)) { q=p p=p->next }
if(p->data==x)/**/ { if(p==h)/**/ h=h->next
elseq->next=p->next free(p)/**/ } returnh }
9. Map Reduce the Free Lunch is not over? C (2) (95) (1) C C C
C setjmplongjmp.. C ?? C C [1] tonyxiaohome 2010-06-12 13:04:06
http://g.51cto.com/tonyxiaohome 2 5 6 Copyright By 51CTO.COM
converted by Web2PDFConvert.com
LOAD MORE