What do Hitler, Napoleon, and Julius Caesar have in common? They have all won major battles using the simple yet effective method of divide and conquer. Divide and conquer has always been a fantastic approach for solving complex problems. This also stands true for data retrieval. Binary search, based on the principle of divide and conquer, is a widely used search algorithm. Try it yourself Consider that you want to look for the word ‘Search’ in the dictionary. Intuitively, you would open the dictionary in the middle and see if the first letter of the page comes after or before the letter ‘S ..read more

A binary tree is defined as a data structure that is non-linear in nature and follows a hierarchical structure. Also, it has a maximum of two children nodes for each of its parent nodes. The word binary is self-explanatory since it is associated with the number two. Every node in a binary tree is associated with three distinct fields, namely: Data element Reference to the left child node Reference to the right child node Given above is a simple diagram of a binary tree data structure. As you can see, the tree has a hierarchical structure and descends from a root node (with value 1). You ma ..read more

Introduction to Sorting Sorting is one of the most important problems that is studied in computer science. It is necessary for any application to run smoothly. 10 Best Sorting Algorithms - Explained with Simple Examples Find out which is the best sorting algorithm. Understand how to use the different types of sorting algorithms with simple examples. Crio BlogSandipan Das Say you just started a clothing website, and you need to add a filter that sorts the clothes according to their price. You definitely need code that will sort these clothes in a particular order. There are some inbuilt so ..read more

What is DSA? DSA stands for Data Structures and Algorithms. It is also sometimes referred to as PSDS - Problem Solving Data Structures. DSA is applied in problem-solving and enables developers to learn to write efficient code. The quality of the code can be judged by how much memory and time it consumes. The lesser memory the code consumes and the faster it runs, the more efficient it is. Why is DSA important? A person equipped with strong DSA skills will have better and more efficient approaches to solving a problem than someone who is not aware of DSA concepts. You might not apply DSA direc ..read more

What is time complexity? Time complexity is a programming term that quantifies the amount of time it takes a sequence of code or an algorithm to process or execute in proportion to the size and cost of input. It will not look at an algorithm's overall execution time. Rather, it will provide data on the variation (increase or reduction) in execution time when the number of operations in an algorithm increases or decreases. Yes, as the definition suggests, the amount of time it takes is solely determined by the number of iterations of one-line statements inside the code. Take a look at this pie ..read more

Why do you need knowledge of data structures and algorithms? Data structures and Algorithms are techniques used to write efficient code for a given problem, much like how you need music theory to master an instrument. To be a good programmer you need to learn to use the right data structure and algorithm for a given problem. Say, you need to travel to a particular spot in your city. You take a car to travel to the spot but later discover that taking the metro would have been faster and cheaper. Similarly, insufficient knowledge in DSA can lead you to write inefficient code. In interviews, an ..read more

Before you begin.. Try giving a shot at common MAANG Sorting Algorithms Interview Questions before reading the blog. Answer MAANG Interview QuestionsAfter you read the blog.. Answer more advanced questions to be absolutely interview-ready. Check out the quiz at the end. Read this blog to get a perfect score in that quiz :) The arrangement of data in a specific order (ascending or descending) is termed sorting in data structures. Sorting data makes it easier to search through a given data sample, efficiently and quickly. Why are Sorting Algorithms Important? Since sorting can often help reduce ..read more

Merge Sort is the perfect example of the Divide and Conquer algorithm design. Given an array, it divides the array into two halves, sorts these two halves recursively, and then, it merges the two smaller sorted arrays into a larger sorted array. Amongst popular sorting algorithms, Merge Sort stands out for a reason. Do you know why? Its time complexity is impressive! In this blog, you will gain a thorough understanding of Merge Sort and try out fun activities to get hands-on with this amazing problem-solving algorithm. Without further ado, let’s dive in and learn all about Merge Sort! Merge ..read more

Most programmers often feel the need to sort the data provided to them. Sorted data is easier to understand and process. As resources become increasingly limited and time more valuable, the most efficient sorting mechanism must be implemented based on the characteristics of the data provided. Various types of sorting mechanisms include: Quick Sort Bubble Sort Merge Sort Insertion Sort Selection Sort Heap Sort. Radix Sort Bucket Sort This blog covers the fundamentals to get you started with insertion sort. Before moving forward, make sure you have gone through the earlier blog on 10 best sor ..read more

Note: we are currently not accepting applications for our Applied Data Structures and Algorithms track. Feel free to browse the details of the track in this post and email us at ping@criodo.com to get notified of upcoming batches. Want to switch jobs, but insufficient DS/Algo prep is getting in the way? Looking for a comprehensive study plan to sharpen your DS/Algo skills? Don't feel confident about approaching unseen problems in coding interviews? The Crio DevSprint Applied Data Structures and Algorithms program is the right fit for you. We have the most rigorous learning plan packed into an ..read more