binary search, pearls, selection, double binary search

CRAZY WOLF CRYPTO

— Published 19 October 2017 —

Here is the Pearl No.4: Let A and B be two disjoint ordered collections with distinct elements inside. Their combined size is g…

visualisation, gate io

CRYPTO COIN WHITE PAPER

— Published 22 November 2015 —

It has been almost half year since my last blog post on OCaml. Well, actually I haven't even touched OCaml for that long time. My…

اتریوم به انگلیسی

— Published 05 May 2015 —

In this post, we will talk about producing permuations using OCaml. Generating permutations was actually one of my first self-hom…

DOG WITH HAT CRYPTO

— Published 31 March 2015 —

Happy Easter Our easter egg happens to be Pearl 3. A function $ f $ can have the following properties: $ f $ takes two …

heap, binomial heap

QUE ES COINBASE

— Published 17 March 2015 —

As we described in the previous post, leftist tree is a binary tree based functional heap. It manipulates the tree structure so t…

heap, leftist tree

TESLA TOKEN PRICE

— Published 12 March 2015 —

Heap is one of most important data structure, where the minimum of all elements can always be easily and efficiently retrieved. …

merge, pearls, algorithm, max, divide and conquer, surpassers

FREE BITCOIN MINING

— Published 20 February 2015 —

In a list of unsorted numbers (not necessarily distinct), such as The surpassers of an element are all elements whose indices…

pearls, algorithm, min, selection, quickselect, min missing natural number

COINGECKO SHIBA INU

— Published 02 February 2015 —

Prof. Richard Simpson Bird is a Supernumerary Fellow of Computation at Lincoln College, Oxford, England, and former director of t…

recursion, memoize, untying the recursive knot, memoize recursive

BEST CRYPTO WALLET 2024

— Published 25 January 2015 —

When I wrote the section of When we need later substitution in Mutable, I struggled. I found out that I didn't fully understand …

mutable, shuffle, imperative programming, binary search, memoize

5 BITCOINS TO US DOLLARS

— Published 20 January 2015 —

While OCaml is a functional programming language and emphasises pure functional style, it allows mutable (variables and values) a…

functional programming style, quicksort , execution model , algorithm

BINANCE US WITHDRAWAL

— Published 02 January 2015 —

In pure functional programming, everything is immutable. Strings, lists, values of customised types etc cannot be changed once be…

binary search tree, data structure, ninja, recursion

GNS CRYPTO

— Published 19 December 2014 —

Binary Search Tree (BST) is one of the most classic data structures. The definition for its structure is shown as below: It consi…

recursion, merge, mergesort, algorithm

CASHAPP BITCOIN WALLET

— Published 04 December 2014 —

One essential of computer programming is repeating some operations. This repetition has two forms: for / while loop and recursion…

gateio, data structure

SHX CRYPTO

— Published 26 November 2014 —

This is a post on the three important properties of trees: height, depth and level, together with edge and path. I bet that most …

CRYPTO SOLANA PRICE PREDICTION

— Published 13 November 2014 —

Currently in post-production. Sorry, I still haven't finished this post. As this will be the last post in the magic of thunk ser…

ACHETER BITCOIN

— Published 13 November 2014 —

The dark side of thunk As discussed previously, thunk is used to encapsulate computations for later uses. Although we may not eva…

thunk, stream

BITSMAP

— Published 09 November 2014 —

list The built-in list is a fundamental type in OCaml. We can have a list of numbers such as [1;2;3;4] or functions e.g. [fun x -…

lazy, thunk, stream_list, async

BITCOIN EDGE

— Published 06 November 2014 —

A thunk is simply a function with the unit parameter. For example: let f() = 1 + 2 * 3;; Features It is indeed a function and s…