Skip to content
Snippets Groups Projects
Commit cf17e4e4 authored by Tom Fischer's avatar Tom Fischer
Browse files

[BL] Quicksort: Use arrays directly instead of references.

parent b94a3e12
No related branches found
No related tags found
No related merge requests found
...@@ -77,7 +77,7 @@ void quicksort(std::vector<T1*>& array, std::size_t beg, std::size_t end, std::v ...@@ -77,7 +77,7 @@ void quicksort(std::vector<T1*>& array, std::size_t beg, std::size_t end, std::v
} }
template <typename T1, typename T2 = std::size_t> template <typename T1, typename T2 = std::size_t>
void quicksort(T1* & array, std::size_t beg, std::size_t end, T2* & perm) void quicksort(T1* array, std::size_t beg, std::size_t end, T2* perm)
{ {
// Zip input arrays. // Zip input arrays.
std::vector<std::pair<T1, T2>> data; std::vector<std::pair<T1, T2>> data;
...@@ -103,6 +103,7 @@ void quicksort(T1* & array, std::size_t beg, std::size_t end, T2* & perm) ...@@ -103,6 +103,7 @@ void quicksort(T1* & array, std::size_t beg, std::size_t end, T2* & perm)
perm[beg+i] = data[i].second; perm[beg+i] = data[i].second;
} }
} }
} // end namespace BaseLib } // end namespace BaseLib
#endif /* QUICKSORT_H_ */ #endif /* QUICKSORT_H_ */
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment