Insertion Sort , In Python
Insertion Sort is one of easiest & efficient way to sort small group of numbers . Using Python this algorithm is very very simple to implement .
But in other languages like C it is not s
Number Of Occurence
One Of very commonly asked problem in Job Interviews is To find number of occurrenceof given word in given paragraph . This very easy question but people still make m
ANALYSIS OF SORTING ALGORITHMS
Here are my observation of
The asymptotic behavior
Quick Select -Finding K th Largest
Quick select is one of very popular algorithm used to find k'th largest element in a list. It can be use to find median or finding k'th smallest element etc.
Finding K'th largest ele
Play With Prime
Prime numbers :- Numbers that are only divisible by 1 and by itself .
Now think how to check number is prime or not
n\'th Prime Number
The first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 5th prime is 11.
What is the 10001st prime number???
Heap Basics Extension - Priority Queue
Priority Queue is very commonly used in operating system to schedule task, priority Queue can very easily and very effectively can implement in Heap.
Insert A new Key in Heap :
Heap is also called Left Complete binary tree. i.e Binary tree with some of rightmost node removed.
It is very efficient for priority Queue implementation.
Heap sort is very easy to implement and its time complexity is O(n log(n)).
Pangrams are sentences constructed by using every letter of the alphabet at least once.
Example : "The quick brown fox jumps over the lazy dog"
Example : Apple -------------Shift By 2----------> Crrng
Now write a C++ program to Encrypt data using shift cypher .
Take care that small letters encrypted to