Untitled

SUBMITTED BY: Guest

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

FORMAT: C++

SIZE: 1.1 kB

Raw Download

HITS: 1358

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. //create the list
  14. node *head, *pos; //nlist = head
  15. int done = 1;
  16. int temp;
  17. node *p, *q;
  19. head = (node*)malloc(sizeof(node));
  20. head->num = 2;
  21. pos = (node*)malloc(sizeof(node));
  22. head->next = pos;
  23. pos->num = 1;
  24. pos->next = (node*)malloc(sizeof(node));
  25. pos->next->num = 4;
  26. pos = pos->next;
  27. pos->next = (node*)malloc(sizeof(node));
  28. pos->next->num = 3;
  29. pos->next->next = head;
  30. head = pos->next;
  31. //do the question
  32. do
  33. {
  34. p = head->next;
  35. done = 1;
  36. while (/*1*/)
  37. {
  38. q = p->next;
  39. if (p->num > q->num)
  40. {
  41. temp = p->num;
  42. p->num = q->num;
  43. q->num = temp;
  44. done = 0;
  45. }
  46. p = p->next;
  47. }
  48. }
  49. while (/*2*/);
  51. //print list
  52. pos = head;
  53. printf("%d ", pos->num);
  54. pos = pos->next;
  55. while (pos != head)
  56. {
  57. printf("%d ", pos->num);
  58. pos = pos->next;
  59. }
  61. getch();
  62. }
comments powered by Disqus