Home » datastructure

Tag Archives: datastructure

Tree Map in Java

Bipartite Graph

1. Introduction A Tree Map is a red-black tree-based NavigableMap implementation. A NavigableMap is a SortedMap with some navigation methods – this returns the closest match for given search targets. The sorting is done according to the natural ordering of the keys present in the map. If a Comparator is provided at the creation time then it overrides the natural ...

Read More »

Master Theorem

Bipartite Graph

1. Introduction An algorithm is a well-defined instruction set designed to solve a particular problem for the given input data sets Master theorem refers to the fact that you can solve a problem in a divide-and-conquer way to provide an asymptotic analysis. We can use this in the analysis of many divide and conquer algorithms. This algorithm was firstly presented ...

Read More »

Array Declaration in Java

Bipartite Graph

This article is about the Array Declaration in Java. But before we initialize an array in java, we will explain one important data structure used, the Array. 1. Introduction An array is a collection of items stored at contiguous memory locations. The idea is to store multiple items of the same type together. We can store in an array any ...

Read More »