HOW TO JOIN BUBBLE AND STACKS CODE WITHOUT REMOVING THE OPERATIONS?

STACKS CODE #include #include using namespace std; class Stack { private: int top; int arr[6]; public: Stack() { top = -1; for (int i = 0; i < 6; i++) { arr[i] = 0; } } bool isEmpty() { if (top == -1) return true; else return false; } bool isFull() { if (top == 5) return true; else return false; } void push(int val) { if (isFull()) { cout << "stack isFull" << endl; } else { top++; // 1 arr[top] = val; } } int pop() { if (isEmpty()) { cout << "stack isEmpty" << endl; return 0; } else { int popValue = arr[top]; arr[top] = 0; top--; return popValue; } } int count() { return (top + 1); } int peek(int pos) { if (isEmpty()) { cout << "stack isEmpty" << endl; return 0; } else { return arr[pos]; } } void change(int pos, int val) { arr[pos] = val; cout << "value changed at location " << pos << endl; } void display() { cout << "All values in the Stack are " << endl; for (int i = 5; i >= 0; i--) { cout << arr[i] << endl; } } }; int main() { Stack s1; int option, postion, value; do { cout << "What operation do you want to perform? Please Select Number!" << endl; cout << "" << endl; cout << "0. Click 0 to exit!" << endl; cout << "1. Push() Place an item into the stack." << endl; cout << "2. Pop() Return the item at the top of the stacks and then remove it." << endl; cout << "3. isEmpty() Tells if the stacks is empty or not." << endl; cout << "4. isFull() Tells if the stack is full or not." << endl; cout << "5. peek() Access the item at the position." << endl; cout << "6. count() Get the number of items in the stack." << endl; cout << "7. change() Change the item at the position." << endl; cout << "8. display() Display all items in the stack." << endl; cout << "9. Clear Screen" << endl << endl; cin >> option; switch (option) { case 0: break; case 1: cout << "Enter an item to push in the stack" << endl; cin >> value; s1.push(value); break; case 2: cout << "Pop Function Called - Poped Value: " << s1.pop() << endl; break; case 3: if (s1.isEmpty()) cout << "Stack isEmpty" << endl; else cout << "Stack is not Empty" << endl; break; case 4: if (s1.isFull()) cout << "Stack isFull" << endl; else cout << "Stack is not Full" << endl; break; case 5: cout << "Enter position of item you want to peek: " << endl; cin >> postion; cout << "Peek Function Called - Value at position " << postion << " is " << s1.peek(postion) << endl; break; case 6: cout << "Count Function Called - Number of Items in the Stack are: " << s1.count() << endl; break; case 7: cout << "Change Function Called - " << endl; cout << "Enter position of item you want to change : "; cin >> postion; cout << endl; cout << "Enter value of item you want to change : "; cin >> value; s1.change(postion, value); break; case 8: cout << "Display Function Called - " << endl; s1.display(); break; case 9: system("cls"); break; default: cout << "Enter Proper Option number " << endl; } } while (option != 0); return 0; } BUBBLE CODE # include  using namespace std; void bubbleSort(int a[]) { for (int i = 0; i < 6; i++) { for (int j = 0; j < (6 - i - 1); j++) { if (a[j] > a[j + 1]) { int temp = a[j]; a[j] = a[j + 1]; a[j + 1] = temp; } } } } int main() { int myarray[6]; int size; cout << " LETS DO A BUBBLE SORTING ALGORITHM! " << endl; cout << "PLEASE ENTER 6 NUMBERS IN ANY ORDER: " << endl; for (int i = 0; i < 6; i++) { cin >> myarray[i]; } cout << "Before Sorting" << endl; for (int i = 0; i < 6; i++) { cout << myarray[i] << " "; } bubbleSort(myarray); // sorting cout << endl << "After Sorting" << endl; for (int i = 0; i < 6; i++) { cout << myarray[i] << " "; } return 0; }