## Quick Sort using C

Quicksort (sometimes called partition-exchange sort) is an efficient and very fast sorting algorithm for internal sorting, serving as a systematic […]

Skip to content
# Roy Tutorials

## Quick Sort using C

## Bubble Sort using C

## Straight Selection Sort using C

## Simple Selection Sort using C

## Shell Sort using C

## Straight Insertion Sort using C

## Shuttle Sort using C

## Binary Search using C

## Sequential Search using C

## Binary Tree using pointer in C

Technical…Practical…Theoretical…

Quicksort (sometimes called partition-exchange sort) is an efficient and very fast sorting algorithm for internal sorting, serving as a systematic […]

Bubble sort is one of the most popular sorting methods. It can be treated as a selection sort because it […]

Selection sorting refers to a class of algorithms for sorting a list of items using comparisons. These algorithms select successively […]

The simplest possible technique based on the principle of repeated selection makes use of “n” passes over an array elements. […]

This method makes repeated use of straight insertion or shuttle sort. An array with n elements, in each pass, an […]

Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. […]

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 […]

This example shows how Binary Search Algorithm works. Binary search algorithm is better when an array is sorted because it […]

This example shows how Sequential Search algorithm works. Simple way to search for a key value k in an array […]

Binary tree is an important class of tree in data structure. A node in binary tree can have at most […]