Can you help me findin if there is a sorting algorithm of time complexity better than O(nlog(n)) .?

I have discovered an algorithm to sort with time complexity O(n*log(n)) it is equal to quick sort but the difference is that my time complexity log has base value 10 whereas quick sort has a base value 2.Thus this makes my algorithm work more than double the speed to that of Quick sort.I have seen algo that have time complexity O(log(n)/n) but with n processors ,and mine is obviously not ,please help me get defeated to my algo..I want to know by what expresion my discovery is behind the world.