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

// Node of linked list
struct node
{
	char data[100];
	int counter;
	struct node *next;
};

// Inserting a new node
struct node *insert_sort(struct node *start, char *data, short *op_status) {
	int test = 0;
	struct node *new_node, *ptr, *preptr;
	ptr = start;
	preptr = NULL;

	*op_status = 0;

	// create new node
	new_node = (struct node *)malloc(sizeof(struct node));
	strcpy(new_node->data, data);
	new_node->counter = 1;

	// The list is empty
	if (start==NULL) {
		new_node->next = NULL;
		start = new_node;

		*op_status = 1;
		return start;
	}

	// Non empty list
	while(ptr != NULL) {
		test = strcoll(ptr->data, new_node->data);
		// Node already exists
		if (test == 0) {
			ptr->counter += 1;
			free(new_node);

			*op_status = 0;
			return start;
		}

		if (test > 0)
			break;
		preptr = ptr;
		ptr = ptr->next;
	}

	if (preptr == NULL) {
		new_node->next = ptr;
		start = new_node;
	}
	else {
		preptr->next = new_node;
		new_node->next = ptr;
	}

	*op_status = 1; // new node inserted
	return start;
}

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

void print_list(char **strlist, int n) {
	for (int i=0; i<n; i++) {
		printf("%s\n", strlist[i]);
	}
}

void sort_words(char** strlist, int n)
{
	for(int i = 0; i < n - 1; i++)
		for(int j = i + 1; j < n; j++)
			if(strcmp(strlist[i], strlist[j]) > 0) {
				char* tmp = strlist[i];
				strlist[i] = strlist[j];
				strlist[j] = tmp;
			}
}

int main() {
	char *data[] = {
			"Strawberry",
			"Cherry",
			"Apple",
			"Orange",
			"Lemon"
	};
	printf("\nInput data:\n");
	print_list(data, 5);

	sort_words(data, 5);
	printf("\nSorted data:\n");
	print_list(data,5);

}