DATA TYPES

In computer algorithms, data types play a crucial role in determining how data is stored, processed, and
manipulated. A data type defines the kind of data that a variable can hold, such as numbers, text, or more
complex structures. Different data types help algorithms perform specific operations efficiently. Here are
the main data types used in computer algorithms:

There are 5 major data types in computer algorithms they are

1. Primitive data types

1. Primitive Data Types

These are the most basic data types that are directly supported by the computer's hardware. They include:

a. Integer (int): This represents whole numbers, either positive, negative, or zero. Integers are used in
counting operations, indexing arrays, or looping through a sequence of steps.

Example: -3, 0, 42

b. Floating-point (float, double): This represents real numbers (numbers with decimal points). Floating-
point numbers are used in calculations that require more precision, like financial calculations, scientific
computations, or measuring distances.

Example: 3.14, -0.99, 42.0

c. Character (char): this represents individual characters, such as letters, digits, or symbols. Characters
are used when working with text, like searching for a letter in a word or building strings.

Example: 'A', '7', '!'

d. Boolean (bool): This represents logical values, either True or False. Boolean values are commonly used
in decision-making processes (e.g., "if" conditions) or in controlling loops.

 Example: True, False

2. Composite Data Types

These are more complex data types made by combining primitive types. Some commonly used composite
data types include:

a. Array: this represents a collection of elements, all of the same data type, stored at contiguous memory
locations. Arrays are used to store and access a fixed-size collection of data, like sorting numbers or storing
test scores.
 Example: [3, 5, 7, 9] (an array of integers), ['A', 'B', 'C'] (an array of characters)

b. String: A string is a sequence of characters, often treated as a separate data type. Strings are used for
handling text, like searching, comparing, or concatenating words.

Example: "Hello, World!", "algorithm"

c. Structure (struct): A data structure that can hold multiple data types together. Structures help group
different types of related data into a single unit, often used in more complex data modeling.

 Example: A Student structure might contain a name (string), age (integer), and grade (float).

3. Abstract Data Types (ADTs)

Abstract Data Types are more conceptual, representing how data is stored and manipulated without
specifying how they are implemented. ADTs define operations that can be performed on the data, like
insertion, deletion, and search.

a. List: A list is a collection of elements where each element has a position (index) and duplicates are
allowed. Lists are used in scenarios where order matters, such as when processing a sequence of tasks.

Example: [10, 20, 30, 40]

b. Stack: A stack is a linear data structure that follows the Last-In-First-Out (LIFO) principle, where the
last element added is the first to be removed. Used in function calls, parsing expressions, undo operations
in text editors, and depth-first search (DFS).

Example: Imagine stacking plates; the last plate placed on top is the first one taken off.

c. Queue: A queue is a linear data structure that follows the First-In-First-Out (FIFO) principle, where the
first element added is the first to be removed. Used in scheduling processes, breadth-first search (BFS), or
buffering data.

 Example: A queue of people standing in line for a ticket counter.

d. Tree: This represents a hierarchical data structure with a root and nodes that form a parent-child
relationship. Trees are used in search algorithms, like binary search trees (BST), decision trees, or file
directory structures.

Example: A family tree, or the file system on your computer.

e. Graph: This represents a set of nodes (or vertices) connected by edges. It can represent various
connections, such as a network of roads or friendships in a social network. Used in shortest path algorithms
(like Dijkstra's algorithm), social networks, and web page ranking algorithms.

Example: Nodes represent cities, and edges represent roads connecting the cities.
4. Pointer: This represents a variable that stores the memory address of another variable. Pointers are
used in dynamic memory allocation, data structures like linked lists, and for optimizing algorithms by
directly accessing memory.

Example: If a variable x has a value of 10 and is stored at memory location 0x100, a pointer p could
store 0x100.

5. Enumerated Types (enum): This represents a user-defined data type that consists of a set of
named values (called enumerators). Useful for representing a fixed number of possible options, like the
days of the week or a set of states in a state machine.

Example: enum Days { Monday, Tuesday, Wednesday, Thursday, Friday, Saturday, Sunday
};