README.md

Time sort in c++ 📝

Reads values from a given array. For every element of arr reads and saves value 'time' creates a async job and pauses it for 'time' seconds. Afterwards it assigns value to the array at addres that 'it' points to. The time sorts our array

#include <thread>
#include <future>
#include <chrono>
#include <vector>

/* negative number switcher */
template<typename T>
T* Switch(T* beg, T* end){
	T* ptr = beg;
	T temp; 
	for(T* it=beg; it<end; it++){
		if(*it < 0) {
			temp = *ptr;
			*ptr = *it;
			*it = temp;

			ptr++;
		}
	}
	return ptr-1;
}

/* Time sort */
template<typename T>
void __Tsort(T* begin, T* end, short sign){
	std::vector<std::future<int>> threads;
	size_t size = (end - begin) * sign;
	T* it = begin;

	for(int i=0; i<size; i++){
		threads.push_back(std::async(std::launch::async,[&it,&begin,i,sign](){
			int time = sign*static_cast<int>(*(begin + i * sign));
			std::this_thread::sleep_for(std::chrono::milliseconds(time)); 
			*it= sign*time;
			it+=sign;

			return 1;
		}));
	}
	for(auto&& job : threads)
		job.get();
}

/* helper function */
template<typename T>
void TimeSort(T* begin, T* end){
	T* neg = Switch(begin,end);

	if(*neg< 0) __Tsort(neg,begin-1,-1);
	__Tsort(neg+1,end+1,1);

	return;
}

It accepts arrays with negative numbers !!!

Code is in ./src/TimeSort.h and example of how to use it is in test ./src/main.cpp