There are several websites that have applications/tools to merge images online. Sometimes it becomes very irritating if websites put limitations on the number of images that you can combine or on the number of merged

Read more# Category: Algorithms

Information about various CS algorithms and their implementation

## Python Code to Reduce and Compress Image Files

As a large number of Internet users use cell phones to access online contents, Google started penalizing the websites that are slow and take several seconds to download all the data. If your web pages

Read more## C Program for Fibonacci Numbers With and Without Recursion

The numbers in the Fibonacci sequence follow the following pattern: every number after the first two is the sum of the two preceding ones. First few numbers in the Fibonacci series are as follows: 0, 1, 1, 2, 3,

Read more## Python : Using Matthews correlation coefficient (MCC) as Evaluation Metric in XGboost

In XGboost classifier, if you do not specify the value of the parameter ‘eval_metric’, the default value is used according to the value of the objective function (e.g. rmse for regression, and error for classification,

Read more## Extended Euclid algorithm for GCD in Python

Euclid’s recursive program based algorithm to compute GCD (Greatest Common Divisor) is very straightforward. If we want to compute gcd(a,b) and b=0, then return a, otherwise, recursively call the function using a=b and b=a mod b.

Read more## Quick Sort Algorithm in Python

Quicksort, aka partition-exchange sort, is a divide and conquer algorithm. It’s an efficient algorithm that takes O(nlogn) time to sort n items (on average). In the worst case, it might take O(n2) time.Quicksort first divides

Read more## Merge Sort Algorithm in Python

Merge sort is a divide and conquer algorithm that works as follows.. If the length of the given list is more than 1, divide it into n sublists using recursion, each containing 1 element because

Read more