#BASIC DATA STRUCTURES AND ALGORITHMS SERIES#

The second subarray has elements with values greater than the pivot. The first subarray holds elements with values less than the pivot. It partitions an array in two subarrays based on a specified data element, called the pivot. Then it compares and merges elements back together in the same way they were divided. It divides a list into two halves until it cannot be further divided. Merge sort is ideal for organizing linked lists. Then it selects an element from the unsorted part and places it in the sorted part until all of the elements are sorted. This algorithm divides an array into sorted and unsorted parts. Insertion Sortįor small data sets that are almost sorted, insertion sort is an efficient way to finish the job. Insertion sort, merge sort, and quick sort are three fundamental algorithms for sorting. Sorting algorithms enable other algorithms to run more efficiently, such as searching algorithms. For example, a user may need to sort an array in numerical or lexicographical order. Sorting algorithms are step-by-step procedures for rearranging data in arrays and lists. For example, a binary search tree has two subtrees connected to the root, a left subtree and a right subtree.īecause trees are hierarchical, they often represent data such as file systems and directories. Connected to the root are zero or more subtrees. One type of graph is a tree, which arranges nodes hierarchically. Graphs can show various data relationships, from electrical circuits to the individuals in a social network. Nodes store data elements, and edges represent the relationships among them. As a result, graphs enable computing professionals to solve complex problems using data. They contain multiple levels of data and do not connect elements sequentially.

Graph data structures and algorithms are key computer science concepts. The first element of the queue is always removed first. Unlike stacks, queues place a new element at the bottom of all previously added elements. Queues are collections of data elements that follow the “first-in, first-out” (FIFO) rule.

Stacks are ideal for retrieving recently used objects or data in the order it was entered. Only the element on top of the stack can be removed. A new element added to a stack sits on top of all previously added elements. StackĪ stack is a collection of data elements that follows the “last-in, first-out” (LIFO) rule. This arrangement lets users effectively insert or remove elements from any position of the sequence.

#BASIC DATA STRUCTURES AND ALGORITHMS SERIES#

Linked ListĪ linked list is a series of data elements where each element points to the next. As one of the oldest computer science data structures, arrays exist in almost every computing program. ArrayĪrrays store similar data elements at contiguous memory locations, making it easy to process, sort, and search. Imagine a stack of playing cards or a shelf of books.Ĭommonly used linear data structures are arrays, linked lists, stacks, and queues. Each element directly links to its previous and subsequent elements. Linear data structures are the simplest, arranging data in a single level. There are two types of computer science data structures: linear and nonlinear. Use this blog to explore five types used by today’s computer science professionals. Do you want to build advanced computing expertise? You will need to understand the fundamental data structures and algorithms of computer science.ĭata structures and algorithms are essential in all areas of computing, from operating systems and networking to programming languages.

Basic data structures and algorithms