#include <iostream>
#include <time.h>
#include <stdlib.h>
using namespace std;
typedef enum{
_circle,
_rectangle,
_ellipse
}typeOfFigure;
typedef struct NODE{
void* data;
NODE* nextNode;
};
NODE* createList(int count){
srand(time(0));
NODE *head = new NODE, *currentNode = new NODE, *nextNode = new NODE;
head->nextNode = head;
currentNode = head;
for (int i = 0; i < count; i++) {
typeOfFigure type = (typeOfFigure)(rand()%3 + 0);
nextNode = new NODE;
switch (type) {
case _circle:
nextNode->data = new double(rand()%6 + 5);
break;
case _rectangle:
nextNode-> data = new int(rand()%6 + 5);
break;
case _ellipse:
nextNode-> data = new char(rand()%6 + 5);
break;
default:
nextNode-> data = new char(rand()%6 + 5);
break;
}
currentNode->nextNode = nextNode;
nextNode->nextNode = head;
currentNode = nextNode;
}
return head;
}
bool deleteNode(NODE* head, int indexOfNode){
NODE* currentNode, *nextNode;
if (head != NULL) {
currentNode = head->nextNode;
nextNode=currentNode->nextNode;
} else{
return false;
}
int i = 1;
while (currentNode != head){
if (i == indexOfNode - 1) {
currentNode->nextNode = nextNode->nextNode;
return true;
} else{
currentNode = currentNode->nextNode;
}
nextNode=currentNode->nextNode;
i++;
}
return false;
}
void BubbleSort(NODE* head){
NODE *currentNode, *nextNode, *temp;
while(true){
bool flag = true;
for (currentNode = head, nextNode = currentNode->nextNode; nextNode->nextNode != head; currentNode = currentNode->nextNode, nextNode = currentNode->nextNode) {
if (nextNode->data > (nextNode->nextNode)->data) { // если следующее меньше предыдущего
currentNode->nextNode = nextNode->nextNode;
nextNode->nextNode = (nextNode->nextNode)->nextNode;
(nextNode->nextNode)->nextNode = nextNode;
// currentNode->nextNode = nextNode->nextNode;
}
else{
continue;
}
flag = false; // на данном шаге сортировку выполнили, переходим на следующий
}
if(flag) break;
}
}
int main(){
NODE *list = createList(10);
for(NODE *currentNode = list->nextNode, *nextNode = currentNode->nextNode; nextNode !=list; currentNode = nextNode, nextNode = currentNode->nextNode){
cout << currentNode->data << "\n";
}
BubbleSort(list);
cout << "/////////////";
for(NODE *currentNode = list->nextNode, *nextNode = currentNode->nextNode; nextNode !=list; currentNode = nextNode, nextNode = currentNode->nextNode){
cout << currentNode->data << "\n";
}
return 0;
}