# Data Structures

## Complexities – Average case, Best case and Worst case

Worst Case Analysis (Usually Done) In the worst case analysis, we calculate upper bound on running time of an algorithm. We must know the case that causes maximum number...

## Types of Data Structures- linear and non linear data structure.

Define a linear and non linear data structure. Linear data structure: A linear data structure traverses the data elements sequentially, in which only one data element can directly be...

## Algorithm Efficiency

Some algorithms are more efficient than others. We would prefer to chose an efficient algorithm, so it would be nice to have metrics for comparing algorithm efficiency. The complexity...

## Data Types and its Types

A data type is a classification of data, which can store a specific type of information. Data types are primarily used in computer programming, in which variables are created...

## Introduction to Data Structures

In computer science, a data structure is a particular way of organizing data in a computer so that it can be used efficiently. Different kinds of data structures are...

## Prim`s Algorithm

Prim’s algorithm is also a Greedy algorithm. It starts with an empty spanning tree. The idea is to maintain two sets of vertices. The first set contains the vertices already...

## Kruskal`s Algorithm

Kruskal’s algorithm is a greedy algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. This means it finds a subset of the edges...

## Quick Sort

Quicksort, or partition-exchange sort, is a sorting algorithm developed by Tony Hoare that, on average, makes O(n log n) comparisons to sort n items. In the worst case, it makes O(n2)...

## Dijkstra`s Algorithm

Dijkstra’s algorithm, conceived by computer scientist Edsger Dijkstra in 1956 and published in 1959,is a graph search algorithm that solves the single-source shortest path problem for a graph with...