‘The blog is my first priority of all!’ It might be true and might not be but what we are concerned about here is the word priority. It is simple in English and in any language meaning putting them first ahead of all. In order to do that we should be aware that why we […]
From our earlier posts, we are aware of what a heap is and how basic operations are performed on a heap. One of the basic operations is deletion. Have we ever given a thought to utilizing the deletion operation to execute some other operation? To be honest, even I didn’t know it for some time. […]
Earlier we have learned about Linked List and one of its types Doubly Linked List. Also, we have gone through how binary trees are represented using arrays. If you aren’t aware, you can check them out from the links provided in the “References and Recommendations” section. So, here we shall discuss how to represent binary […]
If I am not wrong, we had an introduction and implementation of Linked List in the earlier posts! If you have not gone through it yet, the links are provided in the section, “Reference and Recommendations”. So, taking the discussion of linked lists a little ahead we will now raise a question. Can there be […]
This post contains operations on Linked List such as Creation, Insertion, Deletion, Concatenation, and Reversing. It also includes a downloadable file containing all the codes implemented as one.
I am pretty sure that we all have seen trees, at least in cartoons! Let us fill a questionnaire regarding the details of a tree. Which is the most vital part of a tree? Or the other way, where does a tree start growing? Root, obviously.What does a tree have connecting to the roots, directly […]
I hope we all have been in a line to pick our order at the cafe or restaurant. Technically, that line is a queue. Who will be served first? The one first in the queue or the later one? Well yes, the first one of course! What do you observe in a queue? First come […]
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” […]
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 […]
“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 […]
Imaginary situation: “There was a theft at someplace and the police are investigating the incident.” No, I am not writing any news article. Let me make a reference to the thief. There are a lot of valuable objects to steal and unfortunately, the thief has only a sack that is capable of particular, say 15 […]
Have you ever thought of how your data on Internet is secured? When you send a photo on any platform, it will be compressed, encrypted and transmitted. The image should be transmitted without any loss in pixels or data. So, several algorithms play a major role in these operations. One such algorithm is Huffman coding […]
Linear search or a sequential search is a method used to find an element in a list or an array. It searches for the element sequentially i.e. one after other until the required element is found. Algorithm: Input the no. of elements in which the number has to be searched. Now, read the list of elements. Input the element to search for. Using a loop, search for the element in the list of elements. Exit loop. Stop. Pseudo Code: Code in Java: Time Complexity: Best case: When the […]
The simplest sorting algorithm ever.
Reading Time | 7-10 min In every course about algorithms, the subject of complexity of algorithms is introduced right at the beginning. This implies that the topic plays an important role in understanding algorithms, and I can assure you that it certainly does. Don’t believe me? Read on. The Need for Speed(complexity) Every algorithm in […]
Techprodezza 