Algora dev log #2!

---

Spent another session focused on building the Sorting Algorithm Index for Algora.

The goal was to create a dedicated hub where users can browse algorithms, compare characteristics, and quickly find the right visualization to explore. Most of the work went into designing the overall layout, building algorithm cards, organizing metadata, and creating filtering and discovery systems.

A large portion of the work has gone into creating the Sorting Algorithm Index, a central hub where users can browse, discover, and eventually compare different sorting algorithms. Most of this process involved designing and implementing the interface using HTML and CSS, with a focus on creating a clean layout that can scale as more algorithms and features are added.

The page now includes searchable algorithm cards, filtering options, learning path recommendations, and categorized algorithm metadata to help users quickly find relevant topics. While the visual design makes up the majority of the implementation, a small amount of TypeScript has also been introduced to support interactive features such as search and filtering.

---

Progress

• Continued work on the Algora frontend
• Improved the landing page and overall UI
• Fixed various styling and layout issues
• Continued polishing the user experience

---

Next Steps

• Implement Python versions of all sorting algorithms
• Implement C++ versions of all sorting algorithms
• Implement Java versions of all sorting algorithms
• Implement C versions of all sorting algorithms
• Connect code implementations to algorithm pages
• Continue work on visualization and comparison tools

---

Planned Sorting Algorithms

• Bitonic Sort
• Bubble Sort
• Bucket Sort
• Counting Sort
• Heap Sort
• Insertion Sort
• Intro Sort
• Merge Sort
• Merge Sort (In Place)
• Quick Sort
• Radix Sort
• Selection Sort
• Shell Sort
• Tim Sort
• Tournament Sort