sorting_algorithms

Author: victorpreston

1000-sort_deck.c

@@ -0,0 +1,109 @@
+#include "deck.h"
+
+/**
+ * *_strcmp - compare two strings
+ *@s1: pointer 1
+ *@s2: pointer 2
+ *Return: An integer + - or 0
+ */
+
+int _strcmp(const char *s1, const char *s2)
+{
+	int i = 0;
+
+	while (*(s1 + i) && *(s2 + i))
+	{
+		if (s1[i] != s2[i])
+			break;
+		i++;
+	}
+	return (s1[i] - s2[i]);
+}
+
+/**
+ * get_card_value - Getting the int card value to work with
+ * @card: Actual card to get value
+ * Return: Card's Value
+ *
+ */
+
+int get_card_value(deck_node_t *card)
+{
+	int value = atoi(card->card->value);
+
+	if (value != 0)
+		return (value);
+	if (_strcmp(card->card->value, "Jack") == 0)
+		return (11);
+	if (_strcmp(card->card->value, "Queen") == 0)
+		return (12);
+	if (_strcmp(card->card->value, "King") == 0)
+		return (13);
+	return (0);
+}
+
+/**
+ * swap_nodes - Swap nodes in a double linked list
+ * @prev: pointer to prev node
+ * @actual: pointer o actual node
+ * @head: to the head of the deck
+ * Return: Nothing
+ */
+
+void swap_nodes(deck_node_t **prev, deck_node_t *actual,
+				deck_node_t **head)
+{
+	(*prev)->next = actual->next;
+	if (actual->next != NULL)
+		actual->next->prev = *prev;
+	actual->prev = (*prev)->prev;
+	actual->next = *prev;
+	if ((*prev)->prev != NULL)
+		(*prev)->prev->next = actual;
+	else
+		*head = actual; /* prev node is NULL*/
+	(*prev)->prev = actual;
+	*prev = actual->prev;
+}
+
+/**
+ * insertion_sort_list - sorts a deck of cards
+ *  in ascending order using the Insertion sort algorithm
+ * @list: list to look into
+ * @option: sort by value if 0, otherwise sort by kind
+ * Return: Nothing
+ */
+
+void insertion_sort_list(deck_node_t **list, int option)
+{
+	deck_node_t *actual, *prev;
+
+	if (list == NULL || *list == NULL)
+		return;
+	for (actual = (*list)->next; actual != NULL; actual = actual->next)
+	{
+		prev = actual->prev;
+		if (!option)
+			while (actual->prev != NULL && get_card_value(actual) <
+											   get_card_value(actual->prev))
+				swap_nodes(&prev, actual, list);
+		else
+			while (actual->prev != NULL && actual->card->kind <
+											   actual->prev->card->kind)
+				swap_nodes(&prev, actual, list);
+	}
+}
+
+/**
+ * sort_deck - sorts a deck of cards.
+ * @deck: Deck to sort
+ * Return: Nothing
+ *
+ */
+void sort_deck(deck_node_t **deck)
+{
+	if (deck == NULL || *deck == NULL)
+		return;
+	insertion_sort_list(deck, 0);
+	insertion_sort_list(deck, 1);
+}

deck.h

@@ -0,0 +1,54 @@
+#ifndef _DECK_H
+#define _DECK_H
+
+#include <stdlib.h>
+#include <stdio.h>
+#include <string.h>
+
+#define TOTAL 52
+
+/**
+ * enum kind_e - Enumeration
+ * @SPADE: SPADE value
+ * @HEART: HEART value
+ * @CLUB: CLUB value
+ * @DIAMOND: DIAMOND value
+ */
+typedef enum kind_e
+{
+	SPADE = 0,
+	HEART,
+	CLUB,
+	DIAMOND
+} kind_t;
+
+/**
+ * struct card_s - Playing card
+ *
+ * @value: Value of the card
+ * From "Ace" to "King"
+ * @kind: Kind of the card
+ */
+typedef struct card_s
+{
+	const char *value;
+	const kind_t kind;
+} card_t;
+
+/**
+ * struct deck_node_s - Deck of card
+ *
+ * @card: Pointer to the card of the node
+ * @prev: Pointer to the previous node of the list
+ * @next: Pointer to the next node of the list
+ */
+typedef struct deck_node_s
+{
+	const card_t *card;
+	struct deck_node_s *prev;
+	struct deck_node_s *next;
+} deck_node_t;
+
+void sort_deck(deck_node_t **deck);
+
+#endif /*_DECK_H*/

main/1000-main.c

@@ -0,0 +1,60 @@
+#include <stdlib.h>
+#include <stdio.h>
+#include "deck.h"
+
+void print_deck(const deck_node_t *deck)
+{
+    size_t i;
+    char kinds[4] = {'S', 'H', 'C', 'D'};
+
+    i = 0;
+    while (deck)
+    {
+        if (i)
+            printf(", ");
+        printf("{%s, %c}", deck->card->value, kinds[deck->card->kind]);
+        if (i == 12)
+            printf("\n");
+        i = (i + 1) % 13;
+        deck = deck->next;
+    }
+}
+
+deck_node_t *init_deck(const card_t cards[52])
+{
+    deck_node_t *deck;
+    deck_node_t *node;
+    size_t i;
+
+    i = 52;
+    deck = NULL;
+    while (i--)
+    {
+        node = malloc(sizeof(*node));
+        if (!node)
+            return (NULL);
+        node->card = &cards[i];
+        node->next = deck;
+        node->prev = NULL;
+        if (deck)
+            deck->prev = node;
+        deck = node;
+    }
+    return (deck);
+}
+
+int main(void)
+{
+    card_t cards[52] = {
+        {"Jack", CLUB}, {"4", HEART}, {"3", HEART}, {"3", DIAMOND}, {"Queen", HEART}, {"5", HEART}, {"5", SPADE}, {"10", HEART}, {"6", HEART}, {"5", DIAMOND}, {"6", SPADE}, {"9", HEART}, {"7", DIAMOND}, {"Jack", SPADE}, {"Ace", DIAMOND}, {"9", CLUB}, {"Jack", DIAMOND}, {"7", SPADE}, {"King", DIAMOND}, {"10", CLUB}, {"King", SPADE}, {"8", CLUB}, {"9", SPADE}, {"6", CLUB}, {"Ace", CLUB}, {"3", SPADE}, {"8", SPADE}, {"9", DIAMOND}, {"2", HEART}, {"4", DIAMOND}, {"6", DIAMOND}, {"3", CLUB}, {"Queen", CLUB}, {"10", SPADE}, {"8", DIAMOND}, {"8", HEART}, {"Ace", SPADE}, {"Jack", HEART}, {"2", CLUB}, {"4", SPADE}, {"2", SPADE}, {"2", DIAMOND}, {"King", CLUB}, {"Queen", SPADE}, {"Queen", DIAMOND}, {"7", CLUB}, {"7", HEART}, {"5", CLUB}, {"10", DIAMOND}, {"4", CLUB}, {"King", HEART}, {"Ace", HEART},
+    };
+    deck_node_t *deck;
+
+    deck = init_deck(cards);
+    print_deck(deck);
+    printf("\n");
+    sort_deck(&deck);
+    printf("\n");
+    print_deck(deck);
+    return (0);
+}