saundersp/sorting_algorithms
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

data.hpp : Added counting_sort and radix_sort && optimized some parts

Browse Source
This commit is contained in:
saundersp
2025-08-24 18:51:03 +02:00
parent 6fe9243685
commit ef60a9553e
1 changed files with 44 additions and 108 deletions
Download Patch File Download Diff File Expand all files Collapse all files

150
data.hpp
View File

@@ -342,16 +342,16 @@ namespace asp {
constexpr ArgVal(const size_t& _i, const T& _v) noexcept : indice(_i), val(_v) {} constexpr ArgVal(const size_t& _i, const T& _v) noexcept : indice(_i), val(_v) {}
constexpr bool operator>(const ArgVal<T>& other) const noexcept { constexpr bool operator>(const ArgVal<T>& other) const noexcept {
return std::move(val > other.val); return val > other.val;
} }
constexpr bool operator<(const ArgVal<T>& other) const noexcept { constexpr bool operator<(const ArgVal<T>& other) const noexcept {
return std::move(val < other.val); return val < other.val;
} }
constexpr bool operator>=(const ArgVal<T>& other) const noexcept { constexpr bool operator>=(const ArgVal<T>& other) const noexcept {
return std::move(val >= other.val); return val >= other.val;
} }
constexpr bool operator<=(const ArgVal<T>& other) const noexcept { constexpr bool operator<=(const ArgVal<T>& other) const noexcept {
return std::move(val <= other.val); return val <= other.val;
} }
}; };
@@ -400,17 +400,12 @@ namespace asp {
return ArgVal<T>(i, a[i]); return ArgVal<T>(i, a[i]);
}); });
mergesort(temp_vals, l, r); mergesort(temp_vals, 0, a.length - 1);
Array<size_t> indices(a.length); Array<size_t> indices(a.length);
return std::move(map(indices, [&temp_vals](const size_t& i, const size_t&) -> size_t { return map(indices, [&temp_vals](const size_t& i, const size_t&) -> size_t {
return temp_vals[i].indice; return temp_vals[i].indice;
})); });
}
template<typename T>
Array<size_t> mergesort_arg(const Array<T>& a) noexcept {
return mergesort_arg(a, 0, a.length - 1);
} }
template<typename T> template<typename T>
@@ -440,108 +435,49 @@ namespace asp {
} }
template<typename T> template<typename T>
Array<size_t> counting_sort_arg(const Array<T>& a) noexcept { inline void countsort(Array<T>& a, int64_t k, int64_t pos) noexcept {
Array<size_t> indices = range(a.length); Array<T> output(a.length + 1);
T max = T((a[0] / pos) % k);
return indices; for (size_t i = 1; i < a.length; ++i) {
const T val = a[i];
if (((val / pos) % k) > max)
max = val;
} }
inline void countsort(int a[], int n, int pos){ Array<T> count(max + 1);
int* output = new int[n + 1]; memset(count.data, 0, count.length * sizeof(T));
int max = (a[0] / pos) % 10;
for (int i = 1; i < n; i++) { for (size_t i = 0; i < a.length; ++i)
if (((a[i] / pos) % 10) > max) ++count[size_t((a[i] / pos) % k)];
max = a[i];
} // Prefix sum
int* count = new int[max + 1]; for (size_t i = 1; i < count.length; i++)
for (int i = 0; i < max; ++i)
count[i] = 0;
for (int i = 0; i < n; i++)
count[(a[i] / pos) % 10]++;
for (int i = 1; i < 10; i++)
count[i] += count[i - 1]; count[i] += count[i - 1];
for (int i = n - 1; i >= 0; i--) {
output[count[(a[i] / pos) % 10] - 1] = a[i]; for (size_t i = a.length - 1; i > 0; --i) {
count[(a[i] / pos) % 10]--; const T val = a[i];
output[count[size_t((val / pos) % k)] - 1] = val;
--count[size_t((val / pos) % k)];
} }
for (int i = 0; i < n; i++) const T val = a[0];
a[i] = output[i]; output[count[size_t((val / pos) % k)] - 1] = val;
--count[size_t((val / pos) % k)];
delete[] output; memmove(a.data, output.data, a.length * sizeof(T));
delete[] count;
}
// template<typename T>
// constexpr void radix_sort_256(T* a, const size_t& n) noexcept {
// //template<typename T>
// //void radix_sort(const Array<int32_t>& a) noexcept {
// if (n <= 1)
// //if (a.length <= 1)
// return;
//
// T* output = new T[n]; // output array
// size_t* const count = new size_t[256];
// T* originalArr = a; // So we know which was input
//
// for (size_t shift = 0, s = 0; shift < 4; shift++, s += 8) {
// // Zero the counts
// for (size_t i = 0; i < 256; i++)
// count[i] = 0;
//
// // Store count of occurrences in count[]
// for (size_t i = 0; i < n; i++)
// count[(a[i] >> s) & 0xff]++;
//
// // Change count[i] so that count[i] now contains
// // actual position of this digit in output[]
// for (size_t i = 1; i < 256; i++)
// count[i] += count[i - 1];
//
// // Build the output array
// for (int32_t i = n - 1; i >= 0; i--) {
// // precalculate the offset as it's a few instructions
// const size_t idx = (a[i] >> s) & 0xff;
//
// // Subtract from the count and store the value
// output[--count[idx]] = a[i];
// }
//
// // Copy the output array to input[], so that input[]
// // is sorted according to current digit
//
// // We can just swap the pointers
// swap(a, output);
// }
//
// // If we switched posize_ters an odd number of times,
// // make sure we copy before returning
// if (originalArr == output) {
// swap(a, output);
// for (size_t i = 0; i < n; i++)
// a[i] = output[i];
// }
//
// delete[] output, delete[] count;
// }
constexpr void radix_sort_256(int32_t a[], int n){
int max = a[0];
for (int i = 1; i < n; i++)
if (a[i] > max)
max = a[i];
for (int pos = 1; max / pos > 0; pos *= 10)
countsort(a, n, pos);
} }
template<typename T> template<typename T>
constexpr void radix_sort(const Array<T>& a) noexcept { inline void counting_sort(Array<T>& a) noexcept {
radix_sort_256(a.data.get(), a.length); countsort<T>(a, max(a) + 1, 1);
} }
// template<typename T> template<typename T>
// constexpr Array<size_t> radix_sort_arg(const Array<T>& a) noexcept { constexpr void radix_sort(Array<T>& a) noexcept {
// Array<T> indices = range(a.length); constexpr int64_t k = 10;
// T max = a[0];
// return indices; for (size_t i = 1; i < a.length; i++)
// } if (a[i] > max)
max = a[i];
for (int64_t pos = 1; max / pos > 0; pos *= k)
countsort(a, k, pos);
}
}; };