queue-sort

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <vector>
#include <string>

using namespace std;

struct node {
    int value;
    node* next;
    node(int v) {
        value = v;
        next = nullptr;
    }
};

class myQ {
    public:
  node* first;
  node* last;

  myQ() {
      first = nullptr;
      last = nullptr;
  }

  void add(int value) {
      node* newNode = new node(value);
      if (!first) {
          first = newNode;
      }
      if (!last) {
          last = newNode;
      } else {
        last->next = newNode;
        last = newNode;
      }
  }
};

void sortQ(myQ* queToSort) {
    node* it = queToSort->first;
    for (node* i = queToSort->first; i->next != nullptr; i = i->next) {
        bool swapped = false;
        for (node* j = i->next; j != nullptr; j = j->next) {
            if (i->value > j->value) {
                int tmp = j->value;
                j->value = i->value;
                i->value = tmp;

                swapped = true;
            }
        }
        if (!swapped) {
            return;
        }
    }
}

int main()
{
    myQ* que = new myQ();
    que->add(3);
    que->add(6);
    que->add(67);
    que->add(5);
    que->add(222);
    que->add(5);
    que->add(5);
    que->add(6666);
    que->add(2);
    que->add(44);
    que->add(1);

    sortQ(que);

    cout << "-------" << endl;
    node* it = que->first;
    while(it) {
        cout << it->value << endl;
        it = it->next;
    }
}