queue3.cpp

queue3.cpp

Go Back

// Link to Challenge: https://www.w3resource.com/cpp-exercises/queue/index.php

#include <iostream>
#include <vector>

using namespace std;

class Queue{
    private:

        struct node{
            int data;
            node* next;
        };

        node* head = nullptr;

        // bool isLinked = false;

    public:

        Queue(){

        }

        Queue(std::vector<int> arr){
            enqueue(arr);
        }

        void enqueue(std::vector<int> arr){
            node* tmp = nullptr;
            node* current = nullptr;
            for (int i = 0; i < arr.size(); i++){
                if (head == nullptr){
                    head = new node{arr[i], nullptr};
                    current = head;
                }
                else{
                    tmp = new node{arr[i], nullptr};
                    current -> next = tmp;
                    current = current -> next;
                }
            }
        }

        void print(){
            cout << "Queue Elements: ";
            for (node* i = head; i != nullptr; i = i -> next){
                cout << i -> data << " ";
            }
            cout << endl;
        }

        void sort(){
            for (node* i = head; i != nullptr; i = i -> next){
                for (node* j = i -> next; j != nullptr; j = j -> next){
                    if (i -> data > j -> data){
                        int tmp = i -> data;
                        i -> data = j -> data;
                        j -> data = tmp;
                    }
                }
            }
        }
};

int main(){
    cout << "Test Data: " << endl;
    Queue q1({5, 1, 7, 9, 2, 3});
    cout << "Unsorted " << endl;
    q1.print();
    q1.sort();
    cout << "Sorted " << endl;
    q1.print();
    return 0;
}

Console Output

Test Data:
Unsorted
Queue Elements: 5 1 7 9 2 3
Sorted
Queue Elements: 1 2 3 5 7 9

Go Back