William Wang willshw

The repository for the assignment is public and Github does not allow the creation of private forks for public repositories.

The correct way of creating a private frok by duplicating the repo is documented here.

For this assignment the commands are:

Create a bare clone of the repository. (This is temporary and will be removed so just do it wherever.)

git clone --bare [email protected]:usi-systems/easytrace.git

def quickSort(self, A, start, end):
  if start >= end:
      return

  left, right = start, end
  # key point 1: pivot is the value, not the index
  pivot = A[(start + end) // 2]

 # key point 2: every time you compare left &amp; right, it should be

Merge Sort

Merge sort is a divide and conquer algorithm for sorting a array of elements. Typically, it proceed like this,

Breaks array into two half size arrays
Breaks the half size arrays repeatedly until array reach size of 1
Merge the arrays, comparing the elements, starting from size 1 and work the level up
Finaly merged array is a sorted array

	# [<tag>] (If applied, this commit will...) <subject> (Max 72 char)
	# \|<---- Preferably using up to 50 chars --->\|<------------------->\|
	# Example:
	# [feat] Implement automated commit messages

	# (Optional) Explain why this change is being made
	# \|<---- Try To Limit Each Line to a Maximum Of 72 Characters ---->\|

	# (Optional) Provide links or keys to any relevant tickets, articles or other resources
	# Example: Github issue #23

William Wang willshw

Merge Sort

Time and Space Complexity

Time: