Hello, World. I'm Jason.

Thanks for visiting my website. Check out my thoughts on my blog, or send a message if you'd like to get in touch.

If you wanna know more about me, check out this page. If you'd like for me to work on your software project, check out the different services that I offer.

Latest Blog Posts

  • Sorting Algorithms in Go

    Sorting Algorithms in Go

    The fundamental sorting algorithms are Bubble Sort, Insertion Sort, Selection Sort, Quick Sort, Merge Sort, and Heap Sort. Out of these, Quick, Merge, and Heap Sort offer the best efficiency. Here's a breakdown of how they work, implemented in Go.

    Check it out
  • Binary Search in Go

    Binary Search in Go

    Binary Search is an algorithm that is used to find out if a number exists in a list, and if so, what it's position in that list is. The strategy is to "divide and conquer", which makes it much faster and more efficient than checking every single number.

    Check it out
  • Working with The Graph Data Structure in Go

    Working with The Graph Data Structure in Go

    Graphs are data structures made up of a bunch of individual nodes that connect to each other. Their main purpose is to model the connection relationships between things. Another name for graphs that you've likely already heard of is "networks".

    Check it out
View more blog posts →