Sliding Window Protocol

We have learned how TCP works. It involves a handshake and acknowledgment from the receiver for each packet or the frame received. This procedure looks fine when the transmission is for smaller data. What if there are millions or billions of data packets or frames? In the present Internet transaction era, it is quite possible. […]

Stack in Data Structures

Abstract Data Types: It is a set of classes or types for objects such that their behavior is defined by a set of operations and values. The definition depicts that only operations can be performed but mention neither how these operations work at the ground level nor how the storage space is consumed. The stack […]

Enhanced Merge Sort

What is Merge Sort? Not remembering? We got you covered. Click here to revise Merge sort. Now, we shall look how we can improvise the conventional or traditional approach of Merge sort. Note: This particular article has been derived from a research paper. The reference to the paper is provided at the “Reference and Recommendations” […]

Quick Sort

Let me start with a question. Have you ever been to a school prayer or assembly? How do you stand there? Based on height. When you are asked to arrange among yourselves, students know that one is the tallest and the other is the smallest of all. They stand at both ends. The remaining would […]

Merge sort

“Together we stand, separated we fall!” Will modify this to “Divide and Conquer”. What we require here is, how to divide the given set of elements and merge (conquer) them in order, basically sort. How this division flows and merging done? Let’s get through it. Algorithm: Step 1: Divide the array into sub-arrays until a […]