Untitled

SUBMITTED BY: Guest

DATE: Nov. 26, 2014, 1:03 p.m.

FORMAT: C++

SIZE: 2.2 kB

Raw Download

HITS: 1240

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;
  29. head = pos->next;
  31. //print list before sorting
  32. pos = head->next;
  33. printf("Before sorting:");
  34. printf("%d ", pos->num);
  35. pos = pos->next;
  36. while (pos != head->next)
  37. {
  38. printf("%d ", pos->num);
  39. pos = pos->next;
  40. }
  41. printf("\n");
  43. do
  44. {
  45. p = head->next;
  46. done = 1;
  47. while (done)
  48. {
  49. q = p->next;
  50. if (p->num > q->num)
  51. {
  52. temp = p->num;
  53. p->num = q->num;
  54. q->num = temp;
  55. done = 0;
  56. }
  57. p = p->next;
  58. }
  59. }while (p!=head);
  61. //print list
  62. pos = head->next;
  63. printf("After sorting:");
  64. printf("%d ", pos->num);
  65. pos = pos->next;
  66. while (pos != head->next)
  67. {
  68. printf("%d ", pos->num);
  69. pos = pos->next;
  70. }
  72. getch();
  73. }
comments powered by Disqus