Segment Tree - Data StructureSegment tree is a recursive data structure used to perform the following queries on an array -
query( a, b) - return the sum of all elements from a to b, i.e. , ar[a]+ ar[a+1]+ar[a+2]... ar[b]
update( a, val) - update the value of ar[a] to val
Generate Prime Numbers Between Two Numbers - Segmented SieveSegmented sieve is used to generate prime numbers between two ranges.
Kruskal Algorithm Is Used To Find Minimum Spanning tree In A GraphIt is an edge based greedy algorithm, where we try to find the subset of edges that would give us the minimum spanning tree.
Finding nth Root Of A Real Number Using Newton RaphsonFinding nth root of a real number using newton raphson method.
Heap Implementation in c++ Heaps are dynamic data structures, which are very fast for extraction of maximum/minimum elements or infact insertion of new elements into it.
Introduction To AlgorithmsApplications run well on mobile with fast processor, but it is not the bottleneck of any application speed. In reality, the algorithm used to optimize the application\'s sub-methods, determine the application speed and smoothness.When applications are made to handle large data,they need to have methods, which can perform their task in fractions of seconds, and therefore, we study algorithms to write code optimally.
Segment Tree - Data Structure Heap Implementation in c++ Introduction To Algorithms