Untitled

SUBMITTED BY: Guest

DATE: Nov. 26, 2014, 12:46 p.m.

FORMAT: C++

SIZE: 1.1 kB

Raw Download

HITS: 1199

Report
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3. #include <string.h>
  5. typedef struct numType
  6. {
  7. int num;
  8. struct numType *next;
  9. }node;
  11. void main()
  12. {
  13. node *head, *pos;
  14. int done = 1;
  15. int temp;
  16. node *p, *q = NULL;
  18. head = (node*)malloc(sizeof(node));
  19. head->num = 2;
  20. pos = (node*)malloc(sizeof(node));
  21. head->next = pos;
  22. pos->num = 1;
  23. pos->next = (node*)malloc(sizeof(node));
  24. pos->next->num = 4;
  25. pos = pos->next;
  26. pos->next = (node*)malloc(sizeof(node));
  27. pos->next->num = 3;
  28. pos->next->next = head;
  29. head = pos->next;
  31. do
  32. {
  33. p = head->next;
  34. done = 1;
  35. while (/*1*/)
  36. {
  37. q = p->next;
  38. if (p->num > q->num)
  39. {
  40. temp = p->num;
  41. p->num = q->num;
  42. q->num = temp;
  43. done = 0;
  44. }
  45. p = p->next;
  46. }
  47. }
  48. while (/*2*/);
  50. //print list
  51. pos = head;
  52. printf("%d ", pos->num);
  53. pos = pos->next;
  54. while (pos != head)
  55. {
  56. printf("%d ", pos->num);
  57. pos = pos->next;
  58. }
  60. getch();
  61. }
comments powered by Disqus