Ankur's Blog

Time Complexity: If we assume that insertion in a bucket takes O(1) time then steps 1 and 2 of the above algorithm clearly take O(n) time. The O(1) is easily possible if we use a linked list to represent a bucket (In the following code, C++ vector is used for simplicity). Step 4 also takes O(n) time as there will be n items in all buckets.

Heap Sort

Ankur's BlogFebruary 19, 2019Algorithm, GeeksForGeeks, Sorting No comments

Heap Sort

Time Complexity: Time complexity of heapify is O(nLogn). Time complexity of createAndBuildHeap() is O(n) and overall time complexity of Heap Sort is O(nLogn).

Radix Sort

Ankur's BlogFebruary 19, 2019Algorithm, Code Repository, Sorting No comments

Complexity: O(n+b)*logb(max_value)

Counting Sort

Ankur's BlogFebruary 19, 2019Algorithm, Code Repository, Sorting No comments

Binary Search Tree (BST)

Ankur's BlogFebruary 19, 2019Datastructure No comments

Binary Search Tree (BST) is a node-based binary tree data structure having the following properties:

The left subtree of a node contains only nodes with keys less than the node’s key.

The right subtree of a node contaisns only nodes with greater than the node’s Key.

The left and right subtree each must also be a binary search tree.

BST has some basic operation like Search, Insert, Delete, Traversal (In-order, pre-order, post-order).If we want to delete a node from BST, Firstly we search this node and delete this node.

Now we make a BST using some data and following the BST properties. The data is given below:

47,40,54,38,30,39,49,60,57,80;

Odd Sum SubSequence

Ankur's BlogFebruary 18, 2019Greedy No comments

problem statement:

You are given sequence *a[1]*, *a[2]*, ..., *a<[n]* of integer numbers of length *n*. Your task is to find such subsequence that its sum is odd and maximum among all such subsequences.
It's guaranteed that given sequence contains subsequence with odd sum.

Subsequence is a sequence that can be derived from another sequence by deleting some elements without changing the order of the remaining elements.

You should write a program which finds sum of the best subsequence.

Solution:

Fractional Knapsack Problem

Ankur's BlogFebruary 18, 2019Algorithm, Code Repository, GeeksForGeeks, Greedy No comments

Fractional Knapsack Problem

Topic: DFS

Solution 01:

Topic: BFS, Flood Fill, DFS

Resource Link:

টিউটোরিয়াল গুলো ক্রম অনুযায়ী সাজানো নাই।

Bucket Sort

Heap Sort

Complexity: O(n+b)*logb(max_value)

Binary Search Tree (BST) is a node-based binary tree data structure having the following properties:

The left subtree of a node contains only nodes with keys less than the node’s key. The right subtree of a node contaisns only nodes with greater than the node’s Key. The left and right subtree each must also be a binary search tree.

problem statement:

Solution:

About Me

My Social Network

About

Popular Posts

Labels

Categories

Pages

Recent Posts

Contact Us

The left subtree of a node contains only nodes with keys less than the node’s key.

The right subtree of a node contaisns only nodes with greater than the node’s Key.

The left and right subtree each must also be a binary search tree.