Listen "Selection Sort"
Episode Synopsis
In computer science, selection sort is an in-place comparison sorting algorithm. It has an O(n²) time complexity, which makes it inefficient on large lists, and generally performs worse than the similar insertion sort
More episodes of the podcast Programmers Quickie
Http 123
04/10/2025
🌐 Scrapingdog: Web Scraping
10/03/2025
🧊 BigData - Apache Iceberg and Streaming
09/03/2025
📊 RDS PostgreSQL vs Redshift
06/03/2025
📚 DevOps - Terraform Providers
25/02/2025
🐳 Startups - Docker Compose
24/02/2025
💡Client - Why Flux
23/02/2025
🌐 Client - jsdom
22/02/2025
⏱️ java.util.Clock: Mocking Time
18/02/2025
ZARZA We are Zarza, the prestigious firm behind major projects in information technology.