Binary Search Algorithm Binary Search Algorithm is the important topic of the Data structure. Moreover, Freestudy9 has all kind of important topic and information about the subject. In computer science, linear search or sequential search is a method for finding a particular value in a list that consists of checking every one of its elements, […]

# Data Structure

## Merge Sort – Algorithm, C Program and Example | Data Structure

Merge Sort Algorithm Merge Sort Algorithm is the important topic of the Data structure. Moreover, Freestudy9 has all kind of important topic and information about the subject. The merge sort algorithm is based on the classical divide-and-conquer paradigm. It operates as follows: DIVIDE: Partition the n-element sequence to be sorted into two subsequences of n/2 […]

## Quick Sort – Algorithm, C Program and Example | Freestudy9

Quick Sort Algorithm Quick Sort Algorithm is the important topic of the Data structure. Moreover, Freestudy9 has all kind of important topic and information about the subject. Quicksort is the currently fastest known sorting algorithm and is often the best practical choice for sorting, as its average expected running time is O(n log(n)). Pick an element, called […]

## Bubble Sort – Algorithm, C Program and Example | Data Structure

Bubble Sort Algorithm Bubble Sort Algorithm is the important topic of the Data structure. Moreover, Freestudy9 has all kind of important topic and information about the subject. Bubble sort sometimes referred as sinking sort. It is a simple sorting algorithm that works by repeatedly stepping through the list to sorted, comparing each pair of adjacent […]

## Types of Indexes – Primary, Clustering and Secondary Indexes

Clustering Indexes Clustering Indexes is the important topic of the Data structure. Moreover, Freestudy9 has all kind of important topic and information about the subject. Primary indexes Clustering indexes Secondary indexes Primary Indexes (Indexed Sequential File) An indexed sequential file is characterized by Sequential organization (ordered on primary key) Indexed on primary key Moreover, An […]

## File Management – Indexing | Data Structure

Indexing File Management Indexing File Management is the important topic of the Data structure. Moreover, Freestudy9 has all kind of important topic and information about the subject. Indexing used to speed up retrieval of records. It was done with the help of a separate sequential file. Each record of in the index file consists of […]

## Files – Hashing (Direct File Organization) | Data Structure

Direct File Organization Direct File Organization is the important topic of the Data structure. Moreover, Freestudy9 has all kind of important topic and information about the subject. It is a common technique used for fast accessing of records on secondary storage. Moreover, Records of a file divided among buckets. A bucket is either one disk […]

## File – Sequential Files | Data Structure

Sequential File Sequential File is the important topic of the Data structure. Moreover, Freestudy9 has all kind of important topic and information about the subject. File A file is a collection of records where a record consists of one or more fields. Each contains the same sequence of fields. Each field is normally of fixed […]

## Collision Resolution Strategies – Synonym Resolution

Collision Resolution Strategies Collision Resolution Strategies is the important topic of the Data structure. Moreover, Freestudy9 has all kind of important topic and information about the subject. Collision resolution is the main problem in hashing. If the element to be inserted mapped to the same location, where an element already inserted then we have a […]

## Hashing Functions in Details with Example – Data Structure

Hashing Functions with Example Hashing Functions with Example is the important topic of the Data structure. Moreover, Freestudy9 has all kind of important topic and information about the subject. Characteristics of a Good Hash Function A good hash function avoids collisions. Moreover, A good hash function tends to spread keys evenly in the array. A […]