bead_sort.c File Reference

Sorting of array list using bead sort More...

#include <stdio.h>
#include <stdlib.h>

Include dependency graph for bead_sort.c:

Macros
#define	BEAD(i, j)   beads[i * max + j]
	Create easy access of elements from a 2D matrix stored in memory as a 1D array.

Functions
void	display (const int *arr, int n)
	Displays the array, passed to this method.
void	bead_sort (int *a, size_t len)
	This is where the sorting of the array takes place.
int	main (int argc, const char *argv[])
	Main function.

Detailed Description

Sorting of array list using bead sort

Function Documentation

main()

int main	(	int	argc,
		const char *	argv[]
	)

Main function.

{
    int n;
    printf("Enter size of array:\n");
    scanf("%d", &n);  // E.g. 8 1 2 3
 
    printf("Enter the elements of the array\n");
    int i;
    int *arr = (int *)malloc(n * sizeof(int));
    for (i = 0; i < n; i++)
    {
        scanf("%d", &arr[i]);
    }
 
    printf("Original array: ");
    display(arr, n);
 
    bead_sort(arr, n);
 
    printf("Sorted array: ");
    display(arr, n);
 
    free(arr);
    return 0;
}

Here is the call graph for this function: