ConsoleApplication1.cpp

#include <iostream>
#include <conio.h>
#include <cmath>
#include<ctime>
//#include<locale.h>

using namespace std;

struct MyList
{
	int data; //èíôîðìàöèîííîå ïîëå
	MyList* next; //óêàçàòåëü íà ñëåäóþùèé ýëåìåíò
	MyList* prev; //óêàçàòåëü íà ïðåäûäóùèé ýëåìåíò
};
MyList* head;
int* my_shaker(MyList* head);
void print_list();
int find_node(const int searched);
void del_node(const int el_for_remove);
void add_list(const int size, const int fill_in_type);
void add_node();
void output_array(int* my_array, const int size);
int* sort_Sheiker(int* my_array, const int size);
int do_input();
void counting(int* my_array, const int size);
int main()
{
	bool stopper = false;
	while (!stopper)
	{

		int size = 0;
		int i = 0;
		setlocale(LC_ALL, "Russsian");
		system("chcp 1251");

		cout << "\nâûáåðèòå æåëàåìîå äåéñòâèå:\n1.ïîèñê ýëåìåíòà\n2.ñîçäàòü ñïèñîê\n3.äîáàâèòü ýëåìåíò\n4.óäàëèòü ýëåìåíò\n5.ñîðòèðîâêà ñïèñêà\n6.âûâîä ñïèñêà\n0.äëÿ çàâåðøåíèÿ\n";
		int x = 0;
		while (x < 48 || x>54)
		{
			x = _getch();
			if (x < 48 || x>54)
			{
				cout << "\nââåäåíî íåêîððåêòíîå çíà÷åíèå, ââåäèòå êîððåêòíîå\n";
			}
		}
		switch (x)
		{
		case 49://ïîèñê ýëåìåíòà
		{
			cout << "\nââåäèòå çíà÷åíèå äëÿ ïîèñêà\n";
			int x = do_input();
			int unique=find_node(x);
			if (unique != 0)
			{
				cout << "\näà, òàêîå çíà÷åíèå åñòü â ñïèñêå, âñòðå÷àåòñÿ îíî "<<unique<<" ðàç\n";
			}
			else
			{
				cout << endl << "\nèñêîìîå çíà÷åíèå â ñïèñêå íå âñòðå÷àåòñÿ\n";
			}
			break;
		}
		case 50://ñîçäàòü ñïèñîê
		{
			int size = 0;
			do
			{
				cout << "\nââåäèòå æåëàåìûé ðàçìåð ñïèñêà:\n";
				size=do_input();
				if (size < 1)
				{
					cout << "\nââåäåíî íåêîððåêòíîå çíà÷åíèå, ïîïðîáóéòå åùå ðàç\n";
				}
			} while (size<1);
			int fill_in_type=0;
			do
			{
				cout << "\nâûáåðèòå âàðèàíò çàïîëíåíèÿ ñïèñêà\n1.çàïîëíåíèå â àâòîìàòè÷åñêîì ðåæèìå\n2.çàïîëíåíèå ñ ðó÷íûì óêàçàíèåì ýëåìåíòîâ\n";
				fill_in_type = _getch();
				if (fill_in_type < 49 || fill_in_type>50)
				{
					cout << "\nââåäåíî íåêîððåêòíîå çíà÷åíèå, ââåäèòå êîððåêòíîå\n";
				}
			} while (fill_in_type < 49 || fill_in_type>50);
			
			

			add_list(size,fill_in_type);
			
			break;

		}
		case 51://äîáàâèòü ýëåìåíò
		{
			cout << "\nââåäèòå æåëàåìîå çíà÷åíèå\n";
			//int temp = do_input();
			add_node();
			break;
		}
		case 52://óäàëèòü ýëåìåíò
		{
			cout << "\nââåäèòå óäàëÿåìîå çíà÷åíèå\n";
			int x = do_input();
			del_node(x);
			break;
		}
		case 53://ñîðòèðîâêà ñïèñêà
		{
			int* temp = new int[2];
			temp[0] = 0;
			temp[1] = 0;
			temp = my_shaker(head);
			cout << "\nêîëè÷åñòâî ñðàâíåíèé = " << temp[0] << endl;
			cout << "\nêîëè÷åñòâî ïåðåñòàíîâîê = " << temp[1] << endl;
			break;
		}
		case 54://âûâîä ñïèñêà
		{
			print_list();
			break;
		}

		case 48:
		{

			stopper = true;

			break;
		}
		default:
			break;
		}



		
		
	}

	return 0;
}
void add_list(const int size,const int fill_in_type)
{
	if (fill_in_type == 50)
	{
		cout << "ââîäèòå ýëåìåíòû ïî îäíîìó\n";
	}
	srand(time(0));
	for (int position = 1; position <= size; position++)
	{
		if (fill_in_type == 50)
		{
			
			add_node();
			
		}
		else if (fill_in_type == 49)
		{
			int value = 1 + rand() % size;
			MyList* Node = new MyList; //ñîçäàíèå íîâîãî ýëåìåíòà
			Node->data = value; //ïðèñâîåíèå ýëåìåíòó çíà÷åíèÿ
			if (head == NULL) //åñëè ñïèñîê ïóñò
			{
				Node->next = Node; //óñòàíîâêà óêàçàòåëÿ next
				Node->prev = Node; //óñòàíîâêà óêàçàòåëÿ prev
				head = Node; //îïðåäåëÿåòñÿ ãîëîâà ñïèñêà
			}
			else
			{
				MyList* p = head;
				p = p->prev;
				p->next->prev = Node;
				Node->next = p->next;
				Node->prev = p;
				p->next = Node;


			}
		}
		else
		{
			cerr << "\níåêîððåêòíûå âõîäíûå äàííûå äëÿ ôóíêöèè\n";
		}
		
	}
}

void add_node()
{
	int value = do_input();
	MyList* Node = new MyList; //ñîçäàíèå íîâîãî ýëåìåíòà
	Node->data = value; //ïðèñâîåíèå ýëåìåíòó çíà÷åíèÿ
	if (head == NULL) //åñëè ñïèñîê ïóñò
	{
		Node->next = Node; //óñòàíîâêà óêàçàòåëÿ next
		Node->prev = Node; //óñòàíîâêà óêàçàòåëÿ prev
		head = Node; //îïðåäåëÿåòñÿ ãîëîâà ñïèñêà
	}
	else
	{
		MyList* p = head;
		p = p->prev;
		p->next->prev = Node;
		Node->next = p->next;
		Node->prev = p;
		p->next = Node;


	}

}

void print_list()
{
	int unique = 0;
	if (head == NULL)
	{
		cout << "\nÑïèñîê ïóñò\n\n";
	}
	else
	{
		MyList* temp = head;
		cout << "\nÝëåìåíòû ñïèñêà: ";
		do
		{
			cout << temp->data << " ";
			temp = temp->next;
			
			if (find_node(temp->data) == 1)
			{
				unique++;
			}

		} while (temp != head);
		cout << "\nêîëè÷åñòâî óíèêàëüíûõ ýëåìåíòîâ â ñïèñêå = "<<unique<<"\n";
	}
}
int find_node(const int searched)
{
	if (head == NULL)
	{
		cout << "\nÑïèñîê ïóñò\n\n";
		return 0;
	}
	else
	{
		int x = 0;
		MyList* temp = head;		
		do
		{
			if (temp->data == searched)
			{
				x++;
			}
			temp = temp->next;
		} while (temp != head);
		//cout << "\n÷èñëî íàéäåíî " << x << " ðàç\n";
		return x;
	}
}
void del_node(const int el_for_remove)
{

	if (head == NULL)
	{
		cout << "\nÑïèñîê ïóñò\n\n";
	}
	else
	{
		if (head->data == el_for_remove)
		{
			head = head->next;
		}
		int x = 0;
		MyList* temp = head;
		do
		{
			if (temp->data == el_for_remove)
			{
				x++;
				temp->prev->next = temp->next;
				temp->next->prev = temp->prev;
			}
			temp = temp->next;
		} while (temp != head);
		if (x != 0)
		{
			cout << "\näà, òàêîå çíà÷åíèå åñòü â ñïèñêå, óäàëåíî îíî " << x << " ðàç\n";
		}
		else
		{
			cout << endl << "èñêîìîå çíà÷åíèå â ñïèñêå íå âñòðå÷àåòñÿ";
		}
	}

}

int do_input()
{
	int temp = 0;
	cin >> temp;
	while (!cin.good()) //Êîíòðîëü êîððåêòíîñòè ââîäèìûõ çíà÷åíèé
	{
		cin.clear();
		cin.ignore();
		cerr << endl << "Ââåäåíî íåêîððåêòíîå çíà÷åíèå, ââåäèòå êîððåêòíîå" << endl;
		cout << endl << "ââåäèòå çíà÷åíèå ";
		cin >> temp;
	}
	return temp;
}
int* my_shaker(MyList* head)
{
	int* iter = new int[2];
	iter[0] = 0;
	iter[1] = 0;
	bool stop = false;
	if (head == NULL)
	{
		cout << "\nÑïèñîê ïóñò\n\n";
	}
	else if (head == head->next)
	{
		cout << "\nâ ñïèñêå âñåãî 1 ýëåìåíò\n";
	}
	else
	{
		int amount_elements = 0;		
		MyList* temp = head;
		MyList* leftstop = head;
		MyList* rightstop = head->prev;
		
		do
		{
			temp = temp->next;
			amount_elements++;
		} while (temp != head);
		
		temp = head;
		int iteration = 0;
		do//öèêë îáùåé ñîðòèðîâêè
		{			
			iteration++;			
			do//öèêë âïðàâî, óâåëè÷åíèå
			{
				if (temp->next->data > temp->data)
				{
					int buff = temp->next->data;
					temp->next->data = temp->data;
					temp->data = buff;	
					iter[1]++;
				}
				temp = temp->next;
				iter[0]++;
			} while (temp != rightstop);
			rightstop = temp->prev;
			temp = rightstop;
			while (temp != leftstop)//öèêë âëåâî,óìåíüøåíèå
			{
				if (temp->prev->data < temp->data)
				{
					int buff = temp->prev->data;
					temp->prev->data = temp->data;
					temp->data = buff;
					iter[1]++;
				}
				temp = temp->prev;
				iter[0]++;
			}			
			leftstop = temp->next;
			temp = leftstop;
		} while (iteration< amount_elements/2);
	}
	return iter;
}