Cycle Sort

// C Program 
// Sort array elements by using Cycle Sort
#include <stdio.h>

//Function which is display array elements
void display(int arr[], int size)
{
	for (int i = 0; i < size; ++i)
	{
		printf("  %d", arr[i]);
	}
	printf("\n");
}
// When given item is not sorted of given array in right side 
// then they are returns new location of right side. 
// Otherwise they returns current location
int valid_position(int arr[], int cycle_start, int item, int size)
{
	int pos = cycle_start;
	//loop controlling variable
	int i = cycle_start + 1;
	while (i < size)
	{
		if (arr[i] < item)
		{
			//Find new position of current cycle element
			pos++;
		}
		i++;
	}
	return pos;
}
//This are used to find the location of next different element
int skip_duplicates(int arr[], int location, int item)
{
	int pos = location;
	//Skip similar elements
	while (item == arr[pos])
	{
		pos++;
	}
	return pos;
}
//Perform the cycle sort in given array
void cycle_sort(int arr[], int size)
{
	// Loop controlling variables
	int pos = 0;
	int item = 0;
	int temp = 0;
	int cycle_start = 0;
	// count number of memory writes operation 
	int writes = 0;
	for (cycle_start = 0; cycle_start < size - 1; cycle_start++)
	{
		//Get current cycle element
		item = arr[cycle_start];
		//Find actual valid location
		pos = valid_position(arr, cycle_start, item, size);
		//Check whether given current cycle elements is need to modified or not
		if (pos != cycle_start)
		{
			pos = skip_duplicates(arr, pos, item);
			if (item != arr[pos])
			{
				//When new location element are different to current cycle element
				temp = arr[pos];
				arr[pos] = item;
				item = temp;
				writes++;
			}
			while (pos != cycle_start)
			{
				//Find actual valid location
				pos = valid_position(arr, cycle_start, item, size);
				pos = skip_duplicates(arr, pos, item);
				if (item != arr[pos])
				{
					temp = arr[pos];
					arr[pos] = item;
					item = temp;
					writes++;
				}
			}
		}
	}
}
int main()
{
	//Define an sorted array of integers
	int arr[] = {
		11,
		8,
		3,
		8,
		32,
		-3,
		1,
		9,
		23,
		2,
		4,
		0,
		5
	};
	//Get the size of array
	int size = sizeof(arr) / sizeof(arr[0]);
	//Before sort
	printf("\n  Before Sort  :\n");
	display(arr, size);
	//Sort element
	cycle_sort(arr, size);
	//After sort
	printf("\n  After Sort  :\n");
	display(arr, size);
	return 0;
}

Output

  Before Sort  :
  11  8  3  8  32  -3  1  9  23  2  4  0  5

  After Sort  :
  -3  0  1  2  3  4  5  8  8  9  11  23  32