## Imperative and Functional Merge Sort in OCaml

So happy to be back! The last two week I was running around seeing doctors, lab technicians, etc because I had a mysterious lump on my neck. It’s still there, but they figured out that…

Skip to content
# Category: Algorithms

## Imperative and Functional Merge Sort in OCaml

## Merge Sort and the Divide and Conquer Approach

## Functional Style Selection Sort in OCaml

## Imperative Style Selection Sort in OCaml

## The Efficiency of an Algorithm

## Imperative and Functional Insertion Sort in OCaml

## Pseudocode, Insertion Sort and Loop Invariant

## Introduction to Algorithms

## Algorithms

Exploring the breadth of software engineering.

So happy to be back! The last two week I was running around seeing doctors, lab technicians, etc because I had a mysterious lump on my neck. It’s still there, but they figured out that…

Algorithm Design Techniques In earlier posts, I went through the insertion sort and the selection sort algorithms. They both use the incremental approach. Each step of the algorithms sorts one element, and thus the algorithms…

In this post I talk about what I have tried and learnt in the process of writing the functional correspondence of the imperative selection sort I wrote earlier in OCaml. I learnt a lot in…

Exercise 2.2-2 of the book Introduction to Algorithms introduced the selection sort algorithm. I decided to write it in OCaml in imperative style. The selection sort algorithm sorts a list first by switching places of…

We need to analyze algorithms to choose the most efficient algorithm to implement. One important aspect we look at is the running time of an algorithm, which often depends on the size of input. (See…

I wrote the insertion algorithm in both imperative and functional styles in OCaml! I talk about the fun and challenges of each style below: Imperative Insertion Sort I strictly follow the pseudocode on p.18 of…

Pseudocode In Chapter 2 of Introduction to Algorithms, the authors introduce pseudocode. Pseudocode is a way to describe algorithms. Pseudocode is not computer code and is not typically concerned with issues of software engineering (e.g.,…

What is an algorithms? From chapter 1 of Introduction to Algorithms, an algorithm is any well-defined procedure that transforms a set of input to a set of output with desired properties. It is a tool…

To be an awesome software engineer, you should know the common algorithms and data structure well. I’m starting my algorithms learning with this book. It is commonly regarded as the best book for learning algorithms. …