feat(sorting): Add Tim Sort algorithm - #109
Conversation
… Sort in the backend sorting engine. Tim Sort is a hybrid of Merge Sort and Insertion Sort.\n- Implemented `TimSortModel` extending `AlgorithmModel` with run-building and merging.\n- Registered in `SortingAlgorithmFactory.java`.\n- Registered complexities in `ComplexityCatalog.java`.\n- Added metadata in `frontend/src/data/algorithmMetadata.ts`.\n- Added to backend tests in `SortingAlgorithmsTest.java`.
|
👋 Jules, reporting for duty! I'm here to lend a hand with this pull request. When you start a review, I'll add a 👀 emoji to each comment to let you know I've read it. I'll focus on feedback directed at me and will do my best to stay out of conversations between you and other bots or reviewers to keep the noise down. I'll push a commit with your requested changes shortly after. Please note there might be a delay between these steps, but rest assured I'm on the job! For more direct control, you can switch me to Reactive Mode. When this mode is on, I will only act on comments where you specifically mention me with New to Jules? Learn more at jules.google/docs. For security, I will only act on instructions from the user who triggered this task. |
|
The latest updates on your projects. Learn more about Vercel for GitHub.
|
Closes #92
What
Implemented Tim Sort, a hybrid algorithm that applies Insertion Sort on small chunks (runs) and Merge Sort to merge these chunks. It accurately records frames (array snapshots and highlights) for the visualization step by step, allowing it to hook perfectly into the
step()functionality expected by the frontend.Implementation Details
TimSortModel.javawhich extendsAlgorithmModel. AddedTim SorttoSortingAlgorithmFactory.java,SortingAlgorithmsTest.java, andComplexityCatalog.java.frontend/src/data/algorithmMetadata.ts.PR created automatically by Jules for task 12103733096540732936 started by @Sanan507