<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Algorithms :: C en rigle.dev</title><link>https://c.rigle.dev/en/ejercicios/algoritmos/index.html</link><description/><generator>Hugo</generator><language>en</language><lastBuildDate>Fri, 05 Jun 2026 00:00:00 +0200</lastBuildDate><atom:link href="https://c.rigle.dev/en/ejercicios/algoritmos/index.xml" rel="self" type="application/rss+xml"/><item><title>Recursion in C: solved exercise to reverse a string</title><link>https://c.rigle.dev/en/ejercicios/algoritmos/recursividad-en-c-ejercicios-resueltos/index.html</link><pubDate>Mon, 09 Feb 2026 00:00:00 +0100</pubDate><guid>https://c.rigle.dev/en/ejercicios/algoritmos/recursividad-en-c-ejercicios-resueltos/index.html</guid><description>Solved recursion exercise in C to reverse strings, understand base case flow, and avoid common recursion mistakes.</description></item><item><title>Binary search in C: solved exercise on sorted arrays</title><link>https://c.rigle.dev/en/ejercicios/algoritmos/busqueda-binaria-en-c-ejercicio-resuelto/index.html</link><pubDate>Fri, 13 Feb 2026 00:00:00 +0100</pubDate><guid>https://c.rigle.dev/en/ejercicios/algoritmos/busqueda-binaria-en-c-ejercicio-resuelto/index.html</guid><description>Solved binary search exercise in C to find target indices in sorted arrays with O(log n) complexity.</description></item><item><title>Bubble sort in C: solved exercise step by step</title><link>https://c.rigle.dev/en/ejercicios/algoritmos/ordenacion-burbuja-en-c-ejercicio-resuelto/index.html</link><pubDate>Sat, 14 Feb 2026 00:00:00 +0100</pubDate><guid>https://c.rigle.dev/en/ejercicios/algoritmos/ordenacion-burbuja-en-c-ejercicio-resuelto/index.html</guid><description>Solved bubble sort exercise in C with comparisons, swaps, and early-exit optimization.</description></item><item><title>Insertion sort in C: solved exercise</title><link>https://c.rigle.dev/en/ejercicios/algoritmos/insercion-directa-en-c-ejercicio-resuelto/index.html</link><pubDate>Mon, 02 Mar 2026 00:00:00 +0100</pubDate><guid>https://c.rigle.dev/en/ejercicios/algoritmos/insercion-directa-en-c-ejercicio-resuelto/index.html</guid><description>Solved insertion sort exercise in C with step-by-step logic, complexity analysis, and common mistakes.</description></item><item><title>Binary insertion sort in C: solved sorting exercise</title><link>https://c.rigle.dev/en/ejercicios/algoritmos/insercion-binaria-en-c-ejercicio-resuelto/index.html</link><pubDate>Tue, 03 Mar 2026 00:00:00 +0100</pubDate><guid>https://c.rigle.dev/en/ejercicios/algoritmos/insercion-binaria-en-c-ejercicio-resuelto/index.html</guid><description>Solved binary insertion sort exercise in C using binary search for insertion position and linear shifts.</description></item><item><title>Shell sort in C: solved exercise step by step</title><link>https://c.rigle.dev/en/ejercicios/algoritmos/shell-sort-en-c-ejercicio-resuelto/index.html</link><pubDate>Sun, 01 Mar 2026 00:00:00 +0100</pubDate><guid>https://c.rigle.dev/en/ejercicios/algoritmos/shell-sort-en-c-ejercicio-resuelto/index.html</guid><description>Solved shell sort exercise in C with gap sequence, complete implementation, and practical comparison with insertion sort.</description></item><item><title>Merge sort in C: solved exercise with divide and conquer</title><link>https://c.rigle.dev/en/ejercicios/algoritmos/merge-sort-en-c-ejercicio-resuelto/index.html</link><pubDate>Thu, 26 Feb 2026 00:00:00 +0100</pubDate><guid>https://c.rigle.dev/en/ejercicios/algoritmos/merge-sort-en-c-ejercicio-resuelto/index.html</guid><description>Merge sort method in C explained step by step with strategy, pseudocode, full solution, and O(n log n) complexity.</description></item><item><title>Quicksort in C: solved exercise with Lomuto partition</title><link>https://c.rigle.dev/en/ejercicios/algoritmos/quicksort-en-c-ejercicio-resuelto/index.html</link><pubDate>Sun, 15 Feb 2026 00:00:00 +0100</pubDate><guid>https://c.rigle.dev/en/ejercicios/algoritmos/quicksort-en-c-ejercicio-resuelto/index.html</guid><description>Solved quicksort exercise in C using Lomuto partition to sort arrays efficiently.</description></item><item><title>Linear search in C: solved exercise on unsorted arrays</title><link>https://c.rigle.dev/en/ejercicios/algoritmos/busqueda-lineal-en-c-ejercicio-resuelto/index.html</link><pubDate>Sun, 24 May 2026 00:00:00 +0200</pubDate><guid>https://c.rigle.dev/en/ejercicios/algoritmos/busqueda-lineal-en-c-ejercicio-resuelto/index.html</guid><description>Solved linear search exercise in C: sequential array traversal, index return, and comparison with binary search.</description></item><item><title>qsort in C: solved exercise with custom comparator</title><link>https://c.rigle.dev/en/ejercicios/algoritmos/qsort-en-c-ejercicio-resuelto/index.html</link><pubDate>Tue, 02 Jun 2026 00:00:00 +0200</pubDate><guid>https://c.rigle.dev/en/ejercicios/algoritmos/qsort-en-c-ejercicio-resuelto/index.html</guid><description>Solved qsort exercise in C to sort arrays with ascending and descending comparators.</description></item><item><title>bsearch in C: solved exercise on sorted array</title><link>https://c.rigle.dev/en/ejercicios/algoritmos/bsearch-en-c-ejercicio-resuelto/index.html</link><pubDate>Wed, 03 Jun 2026 00:00:00 +0200</pubDate><guid>https://c.rigle.dev/en/ejercicios/algoritmos/bsearch-en-c-ejercicio-resuelto/index.html</guid><description>Solved bsearch exercise in C to search sorted arrays using a comparator.</description></item><item><title>Selection sort in C: solved exercise step by step</title><link>https://c.rigle.dev/en/ejercicios/algoritmos/selection-sort-en-c-ejercicio-resuelto/index.html</link><pubDate>Thu, 04 Jun 2026 00:00:00 +0200</pubDate><guid>https://c.rigle.dev/en/ejercicios/algoritmos/selection-sort-en-c-ejercicio-resuelto/index.html</guid><description>Solved selection sort exercise in C to understand minimum selection at each pass.</description></item><item><title>Heap sort in C: solved exercise with max heap</title><link>https://c.rigle.dev/en/ejercicios/algoritmos/heap-sort-en-c-ejercicio-resuelto/index.html</link><pubDate>Fri, 05 Jun 2026 00:00:00 +0200</pubDate><guid>https://c.rigle.dev/en/ejercicios/algoritmos/heap-sort-en-c-ejercicio-resuelto/index.html</guid><description>Solved heap sort exercise in C by building a max heap for O(n log n) sorting.</description></item></channel></rss>