I am down! No one can compete with std! :(, If I implement stds sort and then chang fallback from merge sort to my O(n^2) search in theory it should be faster, shouldnt it ?, wait.. I am reconsidering it shouldnt std=> worst case : o(nlogn) mine with all its fancines O(n^2), I HAVE FAILED