Khaos Inception
Code Aesthetic
Day 13/30
Quicksort
Fibonacci (Memo)
Debounce
Binary Search
Deep Clone
Event Emitter
Promise.all
Paste your JavaScript
function quicksort(arr) { if (arr.length <= 1) return arr; const pivot = arr[Math.floor(arr.length / 2)]; const left = arr.filter(x => x < pivot); const middle = arr.filter(x => x === pivot); const right = arr.filter(x => x > pivot); return [...quicksort(left), ...middle, ...quicksort(right)]; }
Your code's aesthetic
Paste code to generate art
Copy Link
X