Month: July 2017

This is a basic implementaation problem but need to think critically and I used editorial + previous solved…

Pseudocode: bucketSort(arr[], n) 1) Create n empty buckets (Or lists). 2) Do following for every array element…

best video: pseudocode: Radix-Sort(A, d) //It works same as counting sort for d number of passes. //Each…

Algo: COUNTING-SORT(A,B,k) 1. let C[0..k] be a new array 2. for i = 0 to k 3….

code: /* C++ program to find Inorder successor in a BST */ #include<bits/stdc++.h> using namespace std; struct…

code: #include<bits/stdc++.h> using namespace std; struct Node{ int data; struct Node* left; struct Node* right; }; Node*…