Prime number

A Prime number is a natural number that is greater than 1 and it can be divided only by himself or one. Prime numbers = {3 5 7 11 13 Read more


A Palindrome is a text, number or sentence which can be read the same phrase or value backwards and forwards. For instance: Anna(forward)    annA (backwards)  We implement our code Read more


Quicksort is an efficient sorting algorithm, developed by British computer scientist Tony Hoare in 1959. Algorithm:  find Pivot element (it may be the first, last or random value in array) Read more

Java Collections

Collections are a set of data performing administration of all abstract datatypes. ( e.g searching,sorting,inserting,delete).Collections are very helpful by providing useful data structures and reduce programming effort. The disadvantages are Read more

binary search tree

A binary tree is an abstract data type(ADT) in computer science. conditions of BST: Every tree has only 1 root(head) each node has 2 children If the node is greater Read more

bubble sort

Bubblesort Principle Bubblesort is the easiest sorting algorithm to implement. Bubblesort algorithm runs from left to right. If the value is greater than the neighbour, the values will swap with Read more

Linked List

Programming C tutorial: List Prerequisite: Call by Value, Call by reference, pointers In this chapter, you will learn more complex programming skills. I assume you understand the basic concept of Read more


Recursion Recursion is a function that always repeats a specific number of executions over time until abort criteria(s) of execution(s) has(have) reached. 1. Abort critera is a condition when you Read more