Data Structure & Algorithm

It is a view or representation of an entity that includes only the most significant attributes

• Abstract Data Type

• Abstraction

• Abstracted

It is a specialized way of storing and organizing data in a computer so that it can be used efficiently.

• Data Structure

• Data Type

• Variables

This characteristic describes whether the data items are arranged in chronological sequence, such as with an array, or in an unordered sequence, such as with a graph.

• Static or dynamic

• Linear or non-linear

• Homogeneous or non-homogeneous

It is a step by step process to solve a given problem. Take the simplest example below.

• Pseudo code

• Programming

• Algorithm

It is a method of solving problems that involves breaking a problem down into smaller and smaller sub problems until you get to a small enough problem that it can be solved trivially.

• Recursion

• Iteration

• Looping

This is a theoretical analysis of an algorithm.

• A Posterior Analysis

• A Priori Analysis

• A Pesterio Analysis

It is a measure of how well a computer algorithm scales as the amount of data involved increases.

• Big logN Notation

• Big X Notation

• Big O Notation

As the number of items in the sorted array grows, it only takes a logarithmic time relationship to find any given item.

• O(1)

• O(log n)

• O(n²)

In this type of search, a sequential search is made over all items one by one.

• Search

• Binary Search

• Linear Search

It is the process of arranging a list of elements in a particular order.

• Search

• Sorting

• Elements