dilannery
/ sorting.py
Created
April 21, 2021 01:51
Python implementation of Mergesort and Quicksort using Lomuto and Hoare partition.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| def merge(D, L, R): | |
| left_index = 0 | |
| right_index = 0 | |
| for i in range(len(D)): | |
| if left_index >= len(L): | |
| D[i] = R[right_index] | |
| right_index += 1 | |
| elif right_index >= len(R): | |
| D[i] = L[left_index] | |
| left_index += 1 |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| ########################### | |
| # Configuration | |
| ########################### | |
| # use 256 term for pretty colors | |
| set -g default-terminal "screen-256color" | |
| # increase scroll-back history | |
| set -g history-limit 5000 |