Skip to content

Instantly share code, notes, and snippets.

View imwally's full-sized avatar
💭
🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃

Wally Jones imwally

💭
🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃 🎃
View GitHub Profile

Keybase proof

I hereby claim:

  • I am imwally on github.
  • I am wally (https://keybase.io/wally) on keybase.
  • I have a public key whose fingerprint is 5835 86FD C1C0 7631 954E EB9C D9F7 2E5D 52DE D48F

To claim this, I am signing this object:

@imwally
imwally / merge-sort-no-comments.go
Last active March 11, 2016 21:37
An example of the merge sort algorithm written in Go.
package main
import "fmt"
func Split(s []int) ([]int, []int) {
mid := len(s)/2
a := s[:mid]
b := s[mid:]
@imwally
imwally / quick-sort.go
Created April 26, 2016 15:37
The quick sort algorithm in Go.
package main
import (
"fmt"
)
func partition(a []int, lo, hi int) int {
p := a[hi]
for j := lo; j < hi; j++ {
if a[j] < p {
@imwally
imwally / quick-sort-comments.go
Created April 26, 2016 20:45
The quick sort algorithm written in Go with comments explaining each step.
package main
import (
"fmt"
)
func partition(a []int, lo, hi int) int {
// Select the highest index or right most element in the array
// as the pivot.
p := a[hi]
@imwally
imwally / install_whatsnew.sh
Last active July 20, 2017 01:41
Install whatsnew
#!/bin/sh
cd /usr/local/bin &&
curl -s -O https://raw.githubusercontent.com/imwally/scripts/master/whatsnew &&
chmod 755 /usr/local/bin/whatsnew
@imwally
imwally / keybase.md
Created January 29, 2019 02:37
Keybase proof

Keybase proof

I hereby claim:

  • I am imwally on github.
  • I am wally (https://keybase.io/wally) on keybase.
  • I have a public key ASC-QI1CfDOSJSITBC_TNhkgasAEtRssG9aqTpzRBQ16xgo

To claim this, I am signing this object: