Time Complexity ::

• Bubble Sort ::
  1. Best Case : O(N)
  2. Worst Case : O(N²)

• Merge Sort ::
  1. Best Case : O(Nlog(N))
  2. Worst Case : O(Nlog(N))

• Quick Sort ::
  1. Best Case : O(Nlog(N))
  2. Worst Case : O(N²

	COMPARING
	SWAPPING
	UNSORTED
	SORTED