kolo/SortLab
1
0
Fork 0
mirror of https://github.com/koloideal/SortLab.git synced 2026-06-10 10:25:30 +03:00
Code Issues Packages Projects Releases Wiki Activity

skelet

Browse Source
This commit is contained in:
kolo
2026-03-03 16:39:41 +03:00
parent 0a55fef17c
commit 8baca20d36
15 changed files with 123 additions and 15 deletions
Download Patch File Download Diff File Expand all files Collapse all files
include/sorters/BubbleSorter.hpp
+2
View File
@@ -9,6 +9,8 @@ public:
bool isFinished() const override;
std::string getName() const override;
void reset() override;
std::string getTimeComplexity() const override;
std::string getSpaceComplexity() const override;
private:
enum class Phase { COMPARING, SWAPPING, NEXT };
include/sorters/InsertionSorter.hpp
+2
View File
@@ -9,6 +9,8 @@ public:
bool isFinished() const override;
std::string getName() const override;
void reset() override;
std::string getTimeComplexity() const override;
std::string getSpaceComplexity() const override;
private:
enum class Phase { COMPARING, SHIFTING, INSERTING, NEXT };
include/sorters/MergeSorter.hpp
+2
View File
@@ -10,6 +10,8 @@ public:
bool isFinished() const override;
std::string getName() const override;
void reset() override;
std::string getTimeComplexity() const override;
std::string getSpaceComplexity() const override;
private:
enum class Phase { MERGING, COPYING_LEFT, COPYING_RIGHT, COPYING_BACK, NEXT_MERGE };
include/sorters/QuickSorter.hpp
+2
View File
@@ -10,6 +10,8 @@ public:
bool isFinished() const override;
std::string getName() const override;
void reset() override;
std::string getTimeComplexity() const override;
std::string getSpaceComplexity() const override;
private:
enum class Phase { PARTITIONING, SWAPPING_PIVOT, PUSHING_RANGES };
include/sorters/SelectionSorter.hpp
+2
View File
@@ -9,6 +9,8 @@ public:
bool isFinished() const override;
std::string getName() const override;
void reset() override;
std::string getTimeComplexity() const override;
std::string getSpaceComplexity() const override;
private:
enum class Phase { FINDING_MIN, SWAPPING, NEXT };