Insertion sort in C

Here is an example sort using insertion sort, a stable sort, the one of the best sorts for up to 50 or so items, and just a few lines of code. Here is the C code.

#include <stdio.h>

int main() {
	// get the input - hard coded literal list
	int xList[] = {0, 5, 2, 11, 13, 3, 7};
	int xLen;
	int xPos;
	int xValue;
	xLen = 6;
	/// xList goes from 1 to xLen, sentinal at 0
	printf("xList goes from 1 to %d", xLen);
	int xSortPos;
	/// sort the list using insertion sort
	/// 1 to xPos is length of sorted list
	xSortPos = 0;
	/// xList is sorted from 1 to xSortPos
	while (xSortPos != xLen) {
		/// xList is sorted from 1 to xSortPos
		xSortPos += 1;
		xList[0] = xList[xSortPos];
		xPos = xSortPos;
		while (xList[xPos-1] < xList[0]) {
			xList[xPos] = xList[xPos-1];
			xPos -= 1;
			}
		xList[xPos] = xList[0];
		/// xList is sorted from 1 to xSortPos
		}
	/// xList is sorted from 1 to xSortPos
	/// xSortPos equals xLen
	/// xList is sorted from 1 to xLen
	/// further process xList, if needed
	/// output xList
	xPos = 0;
	while (xPos != xLen) {
		xPos += 1;
		xValue = xList[xPos];
		printf("\n%d. %d", xPos, xValue);
		}
	printf("\n");
	return 0;
	}

Here is the output of the C code.

xList goes from 1 to 6
1. 13
2. 11
3. 7
4. 5
5. 3
6. 2

Assuming that the list has been declared and set, here is the code for just the sort (and that needs properly integrated).

xSortPos = 0;
// xList is sorted from 1 to xSortPos
while (xSortPos != xLen) {
	// xList is sorted from 1 to xSortPos
	xSortPos += 1;
	xList[0] = xList[xSortPos];
	xPos = xSortPos;
	while (xList[xPos-1] < xList[0]) {
		xList[xPos] = xList[xPos-1];
		xPos -= 1;
		}
	xList[xPos] = xList[0];
	// xList is sorted from 1 to xSortPos
	}