nani kate, jom ramai2 tuka kos amek HRD next year. skarang je pon hrd dah ade 2 group. bia dak sk celop nih jadikkan 3 group, nk? :p
klo bace blog cidot lagi best. cidot, klo sir piau bace blog ko, ak rase diye nanges kott. hehehe. tp, siyes! bace luahan hati cidot, mmg touching! tu la yg kami2 ni 'aka' mangse2 kjadian rase. knape la sbjek yang sptotnye dak2 4flat yg blaja, kami yang dapat 8flat ni plak kne amek? tak pasal2 sbjek ni slalu kne sumpah seranah.
first2 before amek exam, sume wat muke siyes. tgah jawab exam muke jadi biru ade. yg dok men pemadam pon ade. abes je paper, yg gelak2 ade. saye macam bese, tros blah punye. panas dok lame2 kat exam hall! hohoho. tak tahann. then, bile on9 facebook takde orang len arh. sume dak2 Sk! yang nk campak compiler msok tasik unimas, bagi ikan makan ade. yang buat luahan prasaan ade. yang ting tong cam saye pon ade. sekarang saye dah bjaye mcari konklusi bg persoalan yg slalu wat saye tertanye2. no wonder ramai junior drpd senior dalam kos ni. lpas jadik junior 'aka' lepak 2sem blaja kos nih, sume pakat blah carik kos laen. hurm.
nk share penderitaan kitorang blaja programming sket la kat korang..
nahh.. nikmatilah sepuasnye..
#include
#include
#define NULL 0
struct linked_list
{
int number;
struct linked_list *next;
};
typedef struct linked_list node;
main()
{
int n;
node *head = NULL;
void print (node *p);
node *insert_Sort(node *p, int n);
printf(" Input the list of numbers. \n");
printf(" At end, type -999. \n");
scanf(" %d",&n);
while (n != -999)
{
if (head == NULL ) /* create 'base' mode*/
{
head = (node *)malloc(sizeof(node));
head ->number = n;
head ->next = NULL;
}
else /*insert next time */
{
head= insert_sort (head,n);
}
scanf("%d", &n);
}
printf("\n");
printf(head);
printf("\n")
}
void print(node *list)
{
if (list == NULL )
printf("NULL");
else
{
printf("%d-->",list->number);
printf(list->next);
}
return 0;
}
No comments:
Post a Comment