"Divide and Conquer", said Python

• 

  Python implementation of a divide and conquer algorithm for sorting a list

• 

  Demonstration on a terminal

Inspiration

I was very interested in looking at more ways to think about how blocks in a blockchain essentially are a data structure, and require processing in a way to keep processing time low. This was a way to navigate through different ways a simple list can be sorted using Python, which uses a more streamlined way than regular O(n^2) techniques

What it does

It uses Quick sort to recursively choose a pivot, and then as a pivot is chosen, divide the list into segments around the pivot depending upon a number's logical relation with the pivot. We use 2 different lists: low and high, to denote the numbers less than and greater than the pivot respectively. This happens recursively until the low and high value around the pivot contains a single element.

How we built it

Challenges we ran into

Accomplishments that we're proud of

What we learned

Learned how we can implement sorting of elements through very different approaches. And Quick Sort is really interesting because it uses recursion, however is better than a factorial time complexity.

What's next for "Divide and Conquer", said Python

Built With

• python