Skip to main content

Data Structures Examples

Search This Blog

Contact Us

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Learn C, Data Structures, and javascript on : Click here
Email : pavandeore90@gmail.com

Donations: http://paypal.me/PDUSER

Programming books you should read !

Get link
Facebook
Twitter
Pinterest
Email
Other Apps

Comments

Post a Comment

Popular Posts

Selection sort algorithm

How Selection Sort Works? Set the first element as minimum . Compare minimum with the second element. If the second element is smaller than minimum , assign second element as minimum . Compare minimum with the third element. Again, if the third element is smaller, then assign minimum to the third element otherwise do nothing. The process goes on until the last element. After each iteration, minimum is placed in the front of the unsorted list. For each iteration, indexing starts from the first unsorted element. Step 1 to 3 are repeated until all the elements are placed at their correct positions. // Selection sort in C Program #include <stdio.h> void swap ( int * a , int * b ) { int temp = * a ; * a = * b ; * b = temp ; } void selectionSort ( int array [], int size ) { for ( int step = 0 ; step < size - 1 ; step ++) { int min_idx = step ; for ( int i = step + 1 ; i < size ; i ++) {

Heap Sort Algorithm

Heap Sort is a popular and efficient sorting algorithm in computer programming. Learning how to write the heap sort algorithm requires knowledge of two types of data structures - arrays and trees. The initial set of numbers that we want to sort is stored in an array e.g. [10, 3, 76, 34, 23, 32] and after sorting, we get a sorted array [3,10,23,32,34,76] Heap sort works by visualizing the elements of the array as a special kind of complete binary tree called heap. What is a complete Binary Tree? Binary Tree A binary tree is a tree data structure in which each parent node can have at most two children In the above image, each element has at most two children. Full Binary Tree A full Binary tree is a special type of binary tree in which every parent node has either two or no children. Complete binary tree A complete binary tree is just like a full binary tree, but with two major differences Every level must be completely filled All the leaf elements must

Bubble Sort Algorithm Example

Bubble sort algorithm How Bubble Sort Works? Starting from the first index, compare the first and the second elements.If the first element is greater than the second element, they are swapped. Now, compare the second and the third elements. Swap them if they are not in order. The above process goes on until the last element. The same process goes on for the remaining iterations. After each iteration, the largest element among the unsorted elements is placed at the end. In each iteration, the comparison takes place up to the last unsorted element. The array is sorted when all the unsorted elements are placed at their correct positions. // Bubble sort in C Program #include <stdio.h> void bubbleSort ( int array [], int size ) { for ( int step = 0 ; step < size - 1 ; ++ step ) { for ( int i = 0 ; i < size - step - 1 ; ++ i ) { // To sort in descending order, change">" to "<". if ( array [

Powered by Blogger