Time complexity of sorting algorithms Selection Sort – Youtube Link From the beginning of an array, it finds minimum element in ...
Posts tagged Course
P vs. NP
NP – Complete A problem p in NP is NP-complete if every other problem in NP can be transformed (or reduced) into p in polynomial time. It ...
Hadoop – Mapper & Reducer
MapReduce is a processing technique and a program model for distributed computing based on java. The MapReduce algorithm contains two important ...