Searched For

Sorting Algorithms

Time complexity of sorting algorithms   Selection Sort – Youtube Link From the beginning of an array, it finds minimum element in ...

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 ...

Mimic (ICSE `19)

  A design figure on left shows the Mimic architecture. Mimic takes as input a set of apps and a Mimic script. The Mimic runtime that runs ...

Mocket App (Summer `18)

Mocket is an android application helping users to memorize words. Please visit Github for source code. Total code implementation: Java files > ...