Guest User

Untitled

a guest
Apr 25th, 2018
73
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.49 KB | None | 0 0
  1.  
  2. #include "stdafx.h"
  3. #include "iostream"
  4. #include "conio.h"
  5. using namespace std;
  6. void menu_select();
  7.  
  8. int num[20], n=0;
  9. int ch, len=0, node, temp=0,x;
  10.  
  11. int _tmain(int argc, _TCHAR* argv[])
  12. {
  13. menu_select();
  14. return 0;
  15. }
  16. void menu_select()
  17. {
  18.  
  19.  
  20. for(;;)
  21. {
  22.  
  23. system("cls");
  24. cout<<"Current list: ";
  25.  
  26. for(n=0;num[n]!='\0';n++)
  27.  
  28. {
  29. len++;
  30. cout<<num[n]<<" ";
  31. }
  32.  
  33. cout<<"\n\nO P T I O N S";
  34. cout<<"\n\t0 - Exit";
  35. cout<<"\n\t1 - Add to Tail";
  36. cout<<"\n\t2 - Add to Head";
  37. cout<<"\n\t3 - Delete from Tail";
  38. cout<<"\n\t4 - Delete from Head";
  39. cout<<"\n\t5 - Insert to Specific Node";
  40. cout<<"\n\t6 - Delete Specific Node";
  41. cout<<"\n\t7 - Sort Ascending";
  42. cout<<"\n\t8 - Sort Descending";
  43. cout<<"\n\nChoice: ";
  44. cin>>ch;
  45.  
  46.  
  47. if (ch==0)
  48.  
  49. {
  50. exit(0);
  51. }
  52.  
  53. else if (ch==1)
  54.  
  55. {
  56. cout<<"Add to Tail: ";
  57. cin>>num[n];
  58. n++;
  59.  
  60. }
  61.  
  62. else if (ch==2)
  63.  
  64. {
  65. for(n=len-1;n>=0;n--)
  66. {
  67. num[n+1]=num[n];
  68. }
  69. cout<<"Add to Head: ";
  70. cin>>num[0];
  71. n++;
  72. }
  73.  
  74. else if (ch==3)
  75.  
  76. {
  77. num[n-1]='\0';
  78. n--;
  79. }
  80.  
  81. else if (ch==4)
  82.  
  83. {
  84.  
  85. for(n=0;n<len;n++)
  86. {
  87. num[n]=num[n+1];
  88. }
  89.  
  90. num[len-1]='\0';
  91. n--;
  92. }
  93.  
  94. else if (ch==5)
  95.  
  96. {
  97.  
  98. cout<<"Insert to Specific Node:";
  99. cin>>node;
  100.  
  101. for (n=len-1;n>=node-1;n--)
  102.  
  103. num[n]=num[n-1];
  104. cout<<"Enter a number: ";
  105. cin>>num[node-1];
  106. n++;
  107.  
  108. }
  109.  
  110. else if (ch==6)
  111.  
  112. {
  113. cout<<"Enter Specific node you want to delete: ";
  114. cin>>node;
  115. for(n=node-1;n<len;n++)
  116.  
  117. num[n]=num[n+1];
  118. num[len-1]!='\0';
  119. n--;
  120. }
  121.  
  122. else if (ch==7)
  123.  
  124. {
  125.  
  126. for(x=0;num[x]!='\0';x++)
  127. {
  128.  
  129. for(n=x+1;num[n]!='\0';n++)
  130. if(num[x]>num[n])
  131. {
  132. temp=num[x];
  133. num[x]=num[n];
  134. num[n]=temp;
  135. }
  136.  
  137. }
  138. }
  139.  
  140. else if(ch==8)
  141. {
  142. for(x=0;num[x]!='\0';x++)
  143. {
  144.  
  145. for(n=x+1;num[n]!='\0';n++)
  146.  
  147. if(num[x]<num[n])
  148. {
  149. temp=num[x];
  150. num[x]=num[n];
  151. num[n]=temp;
  152. }
  153.  
  154. }
  155.  
  156. }
  157. getch();
  158.  
  159. }
  160. }
Add Comment
Please, Sign In to add comment