No Suitable Title Found..

Many times I have availed the Cab facility of my office whenever I got late for project work. But yesterday I got a new idea from some guys traveling with me in the same cab. In my office when I am availing cab service, its cost is going to be added on your project cost.

Introduction to Quantum Cryptography

Imagine you want to send some message to your friend and you don't want others to peek on your message. So you lock your message in a box using a key and send the box to your friend and your friend also have a key to unlock the box so he can easily unlock  the box and read the message. In general this is the technique used by any cryptographic algorithm. Locking up the message in  the box is called Encryption and Unlocking is called Decryption. Before message being sent to the receiver the data is encrypted using an encryption algorithm and a secret key. On the receiver side the encrypted data is decrypted using the reverse encryption algorithm. Classical cryptographic algorithms mostly rely on mathematical approaches to secure key transmission. The security  they offer is based upon unproven assumptions and depends on the technology available to an eavesdropper. But rapidly growing parallel technology and Quantum technology may be a threat to these classical cryptography in near future. One of the solutions of these threats is Quantum Cryptography. Now what is Quantum Cryptography? Quantum cryptography is a complex topic because it brings in to play something most people find hard to understand -- quantum mechanics. Now lets focus on some basic quantum physics that we must know to understand this article.

Searching an element in a row and column wise sorted matrix

First let me state the problem we will discuss in this post:  You are given a 2-D array of  nXn size with all the elements sorted in descending order row and column wise. You need to find a particular element in that array.
There may be lots of ways to solve this problem. I will discuss three ways to solve this problem using a
(i)linear search,
(ii)binary search,
(iii) binary search graph [ I know its bit confusing. Don't  go on the name ]