//koriscenj bubble sort

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

int poredi(const void* a, const void *b)
{
  char *  x = *((char **)a);
  char *  y = *((char **)b);
  
  return strcmp(x, y);
}


int main()
{
	char **niske;
	int n, i;

	printf("Uneti dimenziju niza\n");
	scanf("%d", &n);
	
	niske = malloc(n*sizeof(char*));
	
	printf("Uneti niske\n");
	for(i=0; i<n; i++)
	{
		niske[i] = malloc(20*sizeof(char));
		scanf("%s", niske[i]);
	}
	
	qsort(niske, n, sizeof(char*), poredi);
	
	printf("Sortiran niz\n");
	for(i=0; i<n; i++)
	{
		printf("%s\n", niske[i]);
		free(niske[i]);
	}
	
	free(niske);
	
	return 0;	
}