AfterAcademy Tech
In this blog, we will learn about the time and space complexity of an Algorithm. We will learn about worst case, average case, and best case of an algorithm. We will also see various asymptotic notations that are used to analyse an algorithm. So, let's learn the algorithm of an algorithm.
The repeated execution of some groups of code statements in a program is called iteration. We will discuss the idea of iteration in detail in this blog.
In this blog, we will go into the insights of the famous problem-solving approach Divide and Conquer. We will discuss problems like binary search, merge sort and also implementation issues that can come in this approach.
Using recursion, certain problems can be solved quite easily. Several algorithms design techniques and data structures are based on recursive thinking.
Given a Binary Search Tree, find the Kth Largest element in the given tree.
Given a binary tree, invert the binary tree and return it. An inverted form of a Binary Tree is another Binary Tree with left and right children of all non-leaf nodes interchanged. You may also call it the mirror of the input tree.
Given a binary tree, find its minimum depth. The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.
Given an array say A having n elements, the task is to sort the array in wavy manner. In wavy manner the array is in the form where A[0] >= A[1] <= A[2] >= A[3] <= A[4] >= …..
Given an array, find the smallest missing positive integer.
Sort a linked list using insertion sort and return its head.
