Data Structures &

Algorithms

Introduction
Algorithm
In mathematics or computer science, an algorithm is selfcontained step by step set of operations to be performed.
Data Structures
In Computer Science, a data structure is a particular way of
organizing data in a computer so that it can be used defiantly.
Different kinds of data structure are suited to different kind of
applications, and some are highly specialized to specific tasks.
Examples
RDB commonly use B-tree indexes for data retrieval
Complier implementations usually use has tables to look up
identifiers
Usually, efficient data structures are key to designing efficiency
algorithms

Data Structure

Array
List
Stacks
Queues
Hash Table
Heaps
Binary Search Tree
B-tree

1: Array
Array is one type of data structure that store
multiple values.
Each element can be accessed through its index
A number that denotes its order within the data
A[0]

A[1]

A[2]

A[3]

cat

dog

mouse

bird

Basic sort algorithm

Bubble Sort
Selection Sort
Insertion Sort
Heap Sort
Merge Sort
Quicksort

List search
Linear Search
Binary Search

Graph Search

Breadth-First Search (BFS)

Depth-First Search(DFS)
Bellman-Ford Algorithm
Dijkstras Algorithm
A* algorithm (search)