Untitled

SUBMITTED BY: Guest

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

FORMAT: C++

SIZE: 1.1 kB

Raw Download

HITS: 1397

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;
  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;
  30. do
  31. {
  32. p = head->next;
  33. done = 1;
  34. while (/*1*/)
  35. {
  36. q = p->next;
  37. if (p->num > q->num)
  38. {
  39. temp = p->num;
  40. p->num = q->num;
  41. q->num = temp;
  42. done = 0;
  43. }
  44. p = p->next;
  45. }
  46. }
  47. while (/*2*/);
  49. //print list
  50. pos = head;
  51. printf("%d ", pos->num);
  52. pos = pos->next;
  53. while (pos != head)
  54. {
  55. printf("%d ", pos->num);
  56. pos = pos->next;
  57. }
  59. getch();
  60. }
comments powered by Disqus