Java bubble sort implementation.

Java binary search implementation.

Generate n*n two dimensional arrays with serial numbers in Python.

Find max common divisor.

Python fabonacci implementations.

Bubble sort algorithm is comparison based algorithm in which each pair of adjacent elements is compared and elements are swapped if they are not in order. The average and worst case complexity of bubble sort is O(n²) where n is the number of items.

Extract the i-th digit of any integers, where i starts from right to left.