A palindromic number is a number that remains the same when its digits are reversed.
Binary search is a method to find the particular item in the sorted array. In each step, the algorithm divides the array equally and match the middle item. If the key match, return the index. If the key is less than the middle element, search left subarray. Else search right subarray.
Linear search is a method to find a particular item in an array. It start to check each item and compare with search item until it finds. The linear search performs non-sorted items in the array.
Tower Of Hanoi is a mathematical game. It consists of three rods and disks with different size (small, medium and large). The objective of the puzzle is to move the entire stack to another rod.
Fisher–Yates shuffle is an algorithm for generating a random set. The Fisher–Yates shuffle is quite efficient. Shuffling an array randomizes its element order.
Reservoir sampling is a family of randomized algorithms for randomly choosing a sample of k items from a list S containing n items, where n is either a very large or unknown number.
Minimum covering circle problem is a mathematical problem of computing the smallest circle that contains all of a given set of points in the Euclidean plane.