In this example we will see how to represent sparse matrix using C programming language. A sparse matrix is one where most of its elements are zero (0). For example, the following image represents a sparse matrix:

Posted in C

Sparse Matrix using C Program

Here we will see how to evaluate a polynomial using C program. The evaluation means what would be the final result of the polynomial expression. A Polynomial is a mathematical expression involving a sum of powers in one or more variables multiplied by coefficients.

Posted in C

Evaluation of Polynomial expression using C program

Introduction We will see how to solve Josephus problem using pointer in C program. So we are going to use C program as well as pointer to solve Josephus problem. The Josephus problem (or Josephus permutation) is a theoretical problem related to a certain counting-out game. The problem is described as below. People are standing…

Posted in C

How to solve Josephus problem using pointer in C program

Introduction Quick sort or quicksort (sometimes called partition-exchange sort) is an efficient and very fast sorting algorithm for internal sorting, serving as a systematic method for placing the elements of an array in order. When implemented well, it can be about two or three times faster than its main competitors, merge sort and heapsort. In…

Posted in Array C Data Structure Sort Algorithm

Quick Sort using C

Introduction Bubble sort is one of the most popular sorting methods. It can be treated as a selection sort because it is based on successively selecting the smallest element, second smallest element and so on. In order to find the successive smallest elements this process relies heavily on the exchange of the adjacent elements and…

Posted in Array C Data Structure Sort Algorithm

Bubble Sort using C

Selection sorting refers to a class of algorithms for sorting a list of items using comparisons. These algorithms select successively smaller or larger items from the list and add them to the output sequence. This is an improvement of the Simple Selection Sort and it is called Straight Selection Sort. Therefore, instead of replacing the…

Posted in Array C Data Structure Sort Algorithm

Straight Selection Sort using C

The simplest possible technique based on the principle of repeated selection makes use of “n” passes over an array elements. In the i-th pass, the i-th smallest element is selected from the given array and it is placed in the i-th position of a separate output array. The already selected element is not selected next…

Posted in Array C Data Structure Sort Algorithm

Simple Selection Sort using C

I will show here an example on shell sort (invented by Donald Shell) using C programming language. This method makes repeated use of straight insertion or shuttle sort. The method starts by sorting pairs of elements far apart from each other, then progressively reducing the gap between elements to be compared. An array with n…

Posted in Array C Data Structure Sort Algorithm

Shell Sort using C

Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. More details can be found here at https://en.wikipedia.org/wiki/Insertion_sort Let’s say we have an array a, so at each i-th pass, a[i] is successively compared with a[i-1], a[i-2], etc. until an element smaller than a[i] is…

Posted in Array C Data Structure Sort Algorithm

Straight Insertion Sort using C

In Shuttle Sort technique for n elements in an array a, it requires n-1 passes. When i-th pass(1<=i<=n) begins, the first i elements, i.e., elements a[0] to a[i-1] have been sorted and these occupy the first i positions of the array. To insert (i+1)th element, a[i] is compared with a[i-1] and if the value of…

Posted in Array C Data Structure Sort Algorithm

Shuttle Sort using C

This example shows how Binary Search Algorithm works and I am going to implement it using C programming language. Binary search, also known as half-interval search, logarithmic search, or binary chop, is a search algorithm that finds the position of a target value within a sorted array. Binary search compares the target value to the…

Posted in Array C Search Algorithm

Binary Search using C

This example shows how Sequential Search algorithm works. In sequential or linear search an element is searched or found in a list. Simple way to search for a key value k in an array a is to compare the values of the elements in a with k. The process starts with the first element of…

Posted in Array C Search Algorithm

Sequential Search using C