Skip to content
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
81 changes: 81 additions & 0 deletions sem1/test2/test2.2/list.cpp
Original file line number Diff line number Diff line change
@@ -0,0 +1,81 @@
#include <iostream>
#include "list.h"
using namespace std;

struct ListElement
{
int value;
ListElement *next;
};

struct List
{
ListElement *first;
};

void sort(ListElement *element)
{
if (element->next)
{
if (element->value > element->next->value)
{
swap(element->value, element->next->value);
}
sort(element->next);
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

это какая-то очень хитрая реализация сортировки, но мне нравится

if (element->value > element->next->value)
{
swap(element->value, element->next->value);
}
sort(element->next);
}
}

void sortList(List *list)
{
sort(list->first);
}


List *createList()
{
return new List {nullptr};
}

void addElement(ListElement *&element, int value)
{
if (!element)
{
element = new ListElement {value, nullptr};
}
else
{
addElement(element->next, value);
}
}

void addElement(List *list, int value)
{
addElement(list->first, value);
}

void deleteList(List *list)
{
while (list->first)
{
ListElement *current = list->first;
list->first = current->next;
delete current;
}
delete list;
}

void displayList(List *list)
{
ListElement *current = list->first;
while (current)
{
cout << current->value << " ";
current = current->next;
}
cout << endl;
}
12 changes: 12 additions & 0 deletions sem1/test2/test2.2/list.h
Original file line number Diff line number Diff line change
@@ -0,0 +1,12 @@
#pragma once

struct ListElement;
struct List;

List *createList();
void deleteList(List *list);

void swap(ListElement *first, ListElement *second);
void sortList(List *list);
void addElement(List *list, int value);
void displayList(List *list);
22 changes: 22 additions & 0 deletions sem1/test2/test2.2/main.cpp
Original file line number Diff line number Diff line change
@@ -0,0 +1,22 @@
#include <iostream>
#include "list.h"
using namespace std;

int main()
{
List *list = createList();
cout << "Enter number of elements: ";
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

а на списке из 0 элементов оно падает :)

int amount = 0;
cin >> amount;
cout << "Enter values:" << endl;
for (int i = 0; i < amount; i++)
{
cout << i + 1 << ". ";
int value = 0;
cin >> value;
addElement(list, value);
}
sortList(list);
displayList(list);
deleteList(list);
}