Quick sort best and the avarage runining time is \(O(n\log{}n)\).

To learn more about Python generators, see python fun.

Selection sort runining time is very high as \(O(N^2)\).

Binary Search is one of the most fundamental algorithm.

I explain the procedural and functional way of binary search algorithm.

We have alrady explain Website hosted as a container. In this post explained how to host flask web application.

PySpark is one of the most popular ways of using Spark. This blog considers the use of the basic of Spark SQL with data frames.