Advertisement
0xCor3

rebuild error

May 17th, 2020
1,643
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 1.95 KB | None | 0 0
  1. #include<stdio.h> // harusnya include
  2. #include<conio.h> // harusnya menggunakan .h
  3. #include<iostream> // harusnya tidak menggunakan .h dan typo kurang huruf e
  4. using namespace std;
  5.  
  6. void insert(int); // harusnya void
  7. int delet(int); //harusnya int
  8. void display(void); // harusnya void
  9. int queue[5]; //harusnya int
  10. int rear=-1; //harusnya int
  11. int front=-1; //harusnya int
  12.  
  13. main()
  14. {
  15. int n=5;
  16. char op;
  17. //system("cls");
  18. do
  19. {
  20. printf("\n\nPilihan");
  21. printf("\n1. Tambah Data");
  22. printf("\n2. Hapus Data");
  23. printf("\n3. Tampilkan Data");
  24. printf("\nTekan e untuk keluar");
  25. printf("\nPilihan Anda : ");
  26. op=getche();
  27.  
  28. switch(op)
  29. {
  30. case '1':insert(n);break; // harusnya '1' bukan "1"
  31. case '2':delet(n);break; // harusnya '2' bukan "2"
  32. case '3':display(); break; // harusnya '3' bukan "3" dan brek seharusnya break
  33. default:printf("\nWrong operator");
  34. }
  35. }
  36. while(op!='e'); // While seharusnya while
  37. getch(); // Getch seharusnya getch
  38. }
  39. ///////////////////////////////////////////////////
  40. void insert(int n) // Void seharusnya void
  41. {
  42. int item;
  43. if((front==0&&rear==n)||(front==rear+1)) // penambahan tanda ( dan N seharusnya n
  44. { printf("\nQueue over flow");
  45. return;
  46. }
  47.  
  48. if(front==-1)
  49. {
  50. front=0; // o seharusnya 0
  51. rear=0; // o seharusnya 0
  52. }
  53. else if(rear==n)
  54. rear=0;
  55. else
  56. rear=rear+1;
  57. printf("\nMasukan Data : ");// rintf seharusnya printf
  58. scanf("%d",&item);
  59. queue[rear]=item;
  60. }
  61.  
  62. ////////////////////////////////////////
  63. int delet(int n)
  64. {
  65. int item;
  66. if(front==-1)
  67. { printf("\nQueue is empty");
  68.  
  69. }
  70. printf("\nKamu Menghapus : %d",queue[front]); // Printf seharusnya printf
  71. queue[front]=0; // Queue seharusnya queue
  72. if(front==rear) // front seharusnya front
  73. {
  74. front=-1;
  75. rear=-1;
  76. }
  77. else if(front==n)
  78. front=0; // o seharusnya 0
  79. else
  80. front=front+1;
  81. }
  82.  
  83. /////////////////////////////////
  84. void display(void)
  85. {
  86. int i;
  87. printf("\nTampilkan Queue\n");
  88. for(i=0;i<6;i++) // o seharusnya 0
  89. printf("%d  ",queue[i]); // Printf seharusnya printf
  90. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement