ÇóÒ»¸öÁ´±í³ÌÐò c¸ßÊÖÇë½ø
µ¥Á´±íÖи÷½áµã´æ·ÅÒ»¸öÊý£¬Çë°´ÉýÐòÅÅÁÐ
лл ¸÷λ´óϺ
±¾È˳õѧÊý¾Ý½á¹¹ Ï£Íû´óϺ°ïһϠÈëÃÅ
Õâ¸öºÜ¼òµ¥µÄ°¡,Äã¿ÉÒÔ½¨Á¢Ò»¸ö¸¨ÖúÁ´±í,ÿ´ÎÕÒÁ´±íÖÐ×îСµÄÊýµÄ½Úµã²åÈëµ½ÐÂÁ´±íÖÐ,×Ô¼º³¢ÊÔдÏÂ,²»ÄѵÄ
±éÀú¹ýÈ¥£¬Ã°ÅݾͿÉÒÔ¡£
ðÅݰ¢
³õѧ¶¼µÃ»áµÄ
C/C++ code:
#include<stdio.h>
typedef struct node{
char data;
struct node *next;
}Link;
void
display(Link *h)
{
Link *t;
t=h->next;
while(t!=NULL)
{
printf("%d->",t->data);
t=t->next;
}
}
Link *
creat_link()
{
int run=1,v,i=1;
Link *h,*t,*s;
h=(Link *)malloc(sizeof(Link));
if(NULL==h)
exit(1);
t=h;
while(run)
{
printf("please input the %drd node vlaue:",i++);
scanf("%d",&v);
if(v!=-1) //ÊäÈë-1±íʾÁ´±í½áÊø
{
s=(Link*)malloc(sizeof(Link));
if(NULL==s)
exit(1);
s->data=v;
t->next=s;
t=s;
}
else
run=0;
}
t->next=NULL;
printf("before sort,the link is :");
display(h);
return h;
}
void
sort(Link *h)
{
Link *r,*p,*q;
if(h!=NULL)
{
p=h->next;
r=p->next;
p-
Ïà¹ØÎÊ´ð£º
ÔÚueÖдÓÔ¶³ÌunixÓöþ½øÖÆ·½Ê½ÏÂÔØcÎļþµ½±¾µØ£¬ÐÞ¸ÄÖ®ºóÓöþ½øÖÆ·½Ê½ÉÏ´«µ½unixÖУ¬ÔÙÓÃvi´ò¿ª¸ÃÎļþ£¬Ã¿ÐкóÃæ¾Í»áÓÐÒ»¸ö^MµÄ»»Ðзû£¬Èç¹û²ÉÓÃascii·½Ê½ÏÂÔØ£¬¶þ½øÖÆ·½Ê½ÉÏ´«µÄ»°¾ÍûÓÐ^M£¬ÄÇÇëÎÊÕâÑù»á¶Ô³ÌÐòÎļþ ......
ÔËÐл·¾³ÊÇunix£¬ÎÒÓÃueÒÔftp·½Ê½Á¬µ½unixÉÏ£¬È»ºóÔÚueÖбàдc³ÌÐò£¬µ«ÔÚunixÏÂÓÃvi¿´³ÌÐòʱ£¬Ã¿ÐкóÃæ¶¼¶àÁËÒ»¸ö^M£¬Õâ¸öÓ¦¸ÃÊÇunixµÄ»»Ðзû£¬Ã¿´ÎÖ»ÄÜɾ³ýÒ»±éÈ»ºó²ÅÄܱàÒ룬·ñÔò»á±¨´í£¬ÇëÎÊÕâÊÇÔÚueÖÐ×Ö·û±àÂëµÄ ......
Ä㻹ÔÚÐÂÊÖ½×¶ÎÅÇ»²Âð£¿Ä㻹ÔÚ·¢³îÓ¦¸ÃÔõô¼ÌÐøÑ§Ï°CºÍC++Âð£¿
Ⱥ 29152388 ΪÄã½â¿ªÒɻ󣬻¶ÓÐÂÊÖÀÏÊֵļÓÈ룬ÄãµÄ¼ÓÈë¾ÍÊÇÆäËüÈËѧϰµÄ¶¯Á¦
¥ϳöÃŲȱã±ã
ËãÄãºÝ
ÐÂÊֵĸ£Òô°¡···ÖÕÓÚ ......
ÒÑÓÐa,bÁ½¸öÁ´±í£¬Ã¿¸öÁ´±íÖеĽáµã°üÀ¨Ñ§ºÅ£¬³É¼¨¡£ÒªÇó°ÑÁ½¸öÁ´±íºÏ²¢£¬°´Ñ§ºÅÉýÐòÅÅÁÐ
Á¬½Óº¯ÊýÓÐÎÊÌâ Çë¸ßÊÖÖ¸µã
#include <stdio.h>
#include <stdlib.h>
struct student{
int ......
CÅÌ9G£¬ËãÁËһϸ÷ÖÖÎļþ°üÀ¨ÒþÐÎ×ܹ²²»µ½2G£¬¿ÉÊÇϵͳÏÔʾֻʣÓà1¸ö¶àG£¬ÎÒÒѾ½«¸÷ÖÖÁÙʱÎļþ¶¼É¾³ýÁË£¬°üÀ¨´ÅÅÌÇåÀí£¬Ôõô»ØÊ£¿Ð»Ð»»Ø´ð
ʲôϵͳ£¿
ÐéÄâÄÚ´æÉèÖõ½ÆäËüÅÌ£»
¹Ø±Õϵͳ»¹Ô£»
ɾ³ýÐ ......