From 7eee5a78005a9a569186d2c8b4b645a818ab9bf1 Mon Sep 17 00:00:00 2001
From: Stoycho Kyosev <skyosev@192.168.100.17>
Date: Sun, 6 Oct 2024 07:04:44 -0400
Subject: Cleanup

---
 Seminar07/counting-sort.cpp | 40 ----------------------------------------
 1 file changed, 40 deletions(-)
 delete mode 100644 Seminar07/counting-sort.cpp

(limited to 'Seminar07/counting-sort.cpp')

diff --git a/Seminar07/counting-sort.cpp b/Seminar07/counting-sort.cpp
deleted file mode 100644
index be662f2..0000000
--- a/Seminar07/counting-sort.cpp
+++ /dev/null
@@ -1,40 +0,0 @@
-#include<iostream>
-#include<vector>
-#include<algorithm>
-#include<cassert>
-
-void countingSort(std::vector<unsigned>& v) {
-	unsigned elementRange = *std::max_element(v.begin(), v.end()) + 1;
-
-	std::vector<unsigned> count(elementRange, 0);
-	std::vector<unsigned> result(v.size());
-
-	for (size_t i = 0; i < v.size(); i++)
-		count[v[i]]++;
-
-	for (size_t i = 1; i < elementRange; i++)
-		count[i] += count[i - 1];
-
-	for (int i = v.size() - 1; i >= 0; i--) {
-		result[count[v[i]] - 1] = v[i];
-		count[v[i]]--;
-	}
-
-	v = std::move(result);
-}
-
-int main() {
-	std::vector<unsigned> v;
-	const int length = 10000;
-
-	for (size_t i = 0; i < length; i++)
-		v.push_back(rand() * rand());
-
-	countingSort(v);
-	
-	assert(std::is_sorted(v.begin(), v.end()));
-	
-	// for (int x : v) {
-	// 	std::cout << x << " ";
-	// }
-}
\ No newline at end of file
-- 
cgit v1.3.1-26-gb76a