Skip to main content
Ch Virinchi

Ch Virinchi

I’m only human

Elixir programmer, rocket propulsion enthusiast. Web Application developer.

Check out my Blog and Portfolios to see my work or follow me to get in touch.

Recent

Quick Sort
·1095 words·6 mins· loading · loading
Quick Sort is the go-to sorting algorithm for many programmers due to its efficiency and elegance. Lets implement it in Elixir- Understanding the Algorithm Quicksort works on the principle of “divide and conquer”.
Merge Sort
·875 words·5 mins· loading · loading
Merge sort is a divide an conquer algorithm that relies solely on recursion to sort a list, making it the ideal algorithm to implement in Elixir.
Insert Sort
·976 words·5 mins· loading · loading
Insert sort is the defacto algorithm most programmers get started on their journey with. Lets see how to implement it in Elixir. Understanding the Algorithm Insert sort works by maintaining 2 lists.