please need the code for Big-O-Notation of sorting algorithms

[jmbn2k]

HI
Can anyone get me the code for the Big-O-Notation implementation of Quick sort and Bubble Sort........please

(1) BUBBLE SORT

Bubble Sort Time Complexity Space Complexity
Average Case O(n2) 0
Worst Case O(n2) 0

(2) QUICK SORT

Quick Sort Time Complexity Space Complexity
Average Case O(n log n) O(n)
Worst Case O(n2) O(n)

[D_C]

Are you too lazy to Google it?

Quick Sort
Bubble Sort