mirror of
https://github.com/koloideal/SortLab.git
synced 2026-06-10 10:25:30 +03:00
skelet
This commit is contained in:
+2
-2
@@ -201,14 +201,14 @@ void UI::drawInfoOverlay(sf::RenderWindow& window) {
|
|||||||
body2.setCharacterSize(32);
|
body2.setCharacterSize(32);
|
||||||
body2.setScale(0.5f, 0.5f);
|
body2.setScale(0.5f, 0.5f);
|
||||||
body2.setFillColor(sf::Color(200, 200, 200));
|
body2.setFillColor(sf::Color(200, 200, 200));
|
||||||
body2.setString(toSfStr(u8"[1] Bubble Sort Время: O(n\u00B2) / O(n\u00B2) / O(n\u00B2) Память: O(1)\n[2] Selection Sort Время: O(n\u00B2) / O(n\u00B2) / O(n\u00B2) Память: O(1)\n[3] Insertion Sort Время: O(n) / O(n\u00B2) / O(n\u00B2) Память: O(1)\n[4] Merge Sort Время: O(n log n) / O(n log n) / ... Память: O(n)\n[5] Quick Sort Время: O(n log n) / O(n log n) / ... Память: O(log n)"));
|
body2.setString(toSfStr(u8"[1] Bubble Sort Время: O(n) / O(n^2) / O(n^2) Память: O(1)\n[2] Selection Sort Время: O(n^2) / O(n^2) / O(n^2) Память: O(1)\n[3] Insertion Sort Время: O(n) / O(n^2) / O(n^2) Память: O(1)\n[4] Merge Sort Время: O(n log n) / O(n log n) / O(n log n) Память: O(n)\n[5] Quick Sort Время: O(n log n) / O(n log n) / O(n^2) Память: O(log n)"));
|
||||||
|
|
||||||
sf::Text section3;
|
sf::Text section3;
|
||||||
section3.setFont(font_);
|
section3.setFont(font_);
|
||||||
section3.setCharacterSize(42);
|
section3.setCharacterSize(42);
|
||||||
section3.setScale(0.5f, 0.5f);
|
section3.setScale(0.5f, 0.5f);
|
||||||
section3.setFillColor(sf::Color(0, 220, 255));
|
section3.setFillColor(sf::Color(0, 220, 255));
|
||||||
section3.setString(toSfStr(u8"Δ Гистограмма (внизу слева)"));
|
section3.setString(toSfStr(u8"Гистограмма (внизу слева)"));
|
||||||
|
|
||||||
sf::Text body3;
|
sf::Text body3;
|
||||||
body3.setFont(font_);
|
body3.setFont(font_);
|
||||||
|
|||||||
@@ -64,7 +64,7 @@ std::string BubbleSorter::getName() const {
|
|||||||
}
|
}
|
||||||
|
|
||||||
std::string BubbleSorter::getTimeComplexity() const {
|
std::string BubbleSorter::getTimeComplexity() const {
|
||||||
return "O(n) / O(n²) / O(n²)";
|
return "O(n) / O(n^2) / O(n^2)";
|
||||||
}
|
}
|
||||||
|
|
||||||
std::string BubbleSorter::getSpaceComplexity() const {
|
std::string BubbleSorter::getSpaceComplexity() const {
|
||||||
|
|||||||
@@ -68,7 +68,7 @@ std::string InsertionSorter::getName() const {
|
|||||||
}
|
}
|
||||||
|
|
||||||
std::string InsertionSorter::getTimeComplexity() const {
|
std::string InsertionSorter::getTimeComplexity() const {
|
||||||
return "O(n) / O(n²) / O(n²)";
|
return "O(n) / O(n^2) / O(n^2)";
|
||||||
}
|
}
|
||||||
|
|
||||||
std::string InsertionSorter::getSpaceComplexity() const {
|
std::string InsertionSorter::getSpaceComplexity() const {
|
||||||
|
|||||||
@@ -109,11 +109,11 @@ std::string QuickSorter::getName() const {
|
|||||||
}
|
}
|
||||||
|
|
||||||
std::string QuickSorter::getTimeComplexity() const {
|
std::string QuickSorter::getTimeComplexity() const {
|
||||||
return "O(n log n) / O(n log n) / O(n²)";
|
return "O(n log n) / O(n log n) / O(n^2)";
|
||||||
}
|
}
|
||||||
|
|
||||||
std::string QuickSorter::getSpaceComplexity() const {
|
std::string QuickSorter::getSpaceComplexity() const {
|
||||||
return "O(log n)";
|
return "O(n)";
|
||||||
}
|
}
|
||||||
|
|
||||||
void QuickSorter::reset() {
|
void QuickSorter::reset() {
|
||||||
|
|||||||
@@ -77,7 +77,7 @@ std::string SelectionSorter::getName() const {
|
|||||||
}
|
}
|
||||||
|
|
||||||
std::string SelectionSorter::getTimeComplexity() const {
|
std::string SelectionSorter::getTimeComplexity() const {
|
||||||
return "O(n²) / O(n²) / O(n²)";
|
return "O(n^2) / O(n^2) / O(n^2)";
|
||||||
}
|
}
|
||||||
|
|
||||||
std::string SelectionSorter::getSpaceComplexity() const {
|
std::string SelectionSorter::getSpaceComplexity() const {
|
||||||
|
|||||||
Reference in New Issue
Block a user