Saturday, 9 December 2017

Segment Trees and range minimum query

SEGMENTED TREES

We generally come across question involving range queries and update queries which may or may not require to print output after each queries.
For example:-we have an array arr[0.....n-1] and following two queries:
1.find minimum in range [l,r] where 0<l<r<n and output it.
2.upadate each value in range [l,r] and output the new array.

Friday, 20 October 2017

Selection Sort


Hey Everyone !
In this article i am going to describe the Selection Sort Algorithm which has a complexity of O(n^2) and people don't prefer to use this algorithm in competitve programming contests, but i am writing this because it can be asked in viva or during exams in colleges.

Sunday, 6 August 2017

Z-Algorithm


Contents :
  • Objective of this post
  • An Awesome video tutorial on You Tube
  • Implementation in C++
  • Practice Problems

Thursday, 27 July 2017

All about Trie data structure !


Contents :
  1. Introduction to Trie
  2. Insertion of a string in Trie
  3. Searching a string in a Trie
  4. Application : Auto-Complete the keyword

Thursday, 20 July 2017

Understanding Binary Search and Linear Search


Contents :
  • Understanding Linear search and its time complexity
  • Understanding Binary search
  • Implementation of binary search in C++

Wednesday, 19 July 2017

Merge Sort Algorithm


Merge Sort Algorithm is a sorting algorithm which has time complexity of O(nlog(n)) where n is number of elements in the unsorted list. In merge sort algorithm we divide the array in two halves and then sort those

Tuesday, 11 July 2017

Breadth First Search in C++


Prerequisites : Adjacency List, Queue data structure(FIFO)
Breadth First Search :
Like DFS, BFS is another form of Graph traversal Algorithm. Instead of going deeper and deeper, unlike DFS it goes in breadth first faishon which means that if it is on node u currently, then it first visits all the neighbours of node u and then the same thing happens with each of its neighbours. Lets understand how this algorithm works with the help of an example.

Featured Posts

Euler Totient Function

Hello Coders, I am writing this blogpost after a very long time. I am really sorry for that. :( This blogpost is related to a mathemat...