Why is quicksort better than other sorting algorithms ?

The following counts of compare and exchange operations were made for three different sorting algorithms running on the same data:

n	Quick		Heap		Insert
	Comparison	Exchange	Comparison	Exchange	Comparison	Exchange
100	712	148	2,842	581	2,595	899
200	1,682	328	9,736	1,366	10,307	3,503
500	5,102	919	53,113	4,042	62,746	21,083

useful Link 1 useful Link 2 useful link 3