Quick sort has time complexity O(nlog(n)) and bubble sort has, O(n^2) though, so for 1000 numbers the quick sort SHOULD (theoretically) be almost 150 times faster than the bubble sort.