29/07/2021 (thingsi leanred)
- made my own lousy sorting algorithm! not only is it exponential time, it only works for permutations of [1,...,n]!
- badminton can really be edge-of-seat
- twitterers ignoring me pisses me off
- 0, 1, 4, {5*2**(n-3) for n>3}... pickysort worst case scenario at 9th permutation
- almost wetdreams are crazy fuck that shit
- javascript golfing is a little fun, not as fun as python
- OMG I THINK THE SORTING VISUALIZER ACTUALLY GAVE ME A INSIGHT AS TO HOW TO PROVE THE ALGORITHM'S CORRECTNESS!!! It like mostly just stays in the low numbers and once in a while reaches out and grabs a tall bar and pushes it all the way back!
- picky sort is a great name! it's picky about when to grab a tall bar too
- huh why does *high* pitch mean larger frequency? ah i see, higher cuz bigger number for frequency. wait, doesnt make sense, cuz wavelength (size) should be the one determining its *height*. should be the other way round ithink
- my first git conflict!!! try to solve it tmr
- i love pygame omg didnt know so many people use it, tq bucky roberts ? xD
- 

dari random import shuffle secara kocok
semua = all
n = 10
x = kocok(senarai(julat(1, n+1)))
# isihan sombong ~ O(n**2 * 2**n)
ketika bukan semua(x[i] <= x[i+1] untuk i dalam julat(n-1)):
    x = x[1:x[0]+1] + [x[0]] + x[x[0]+1:]
cetak(x)