Explains the math and Python code for perfect in-shuffles and out-shuffles, comparing how many shuffles restore a deck's order.
Explores the mathematics of card shuffling, contrasting random 'rifle shuffles' with deterministic 'perfect shuffles' and their Python implementation.
Analysis of a unique knight's tour with minimal obtuse angles, presented by Donald Knuth in his annual Christmas lecture.
Author announces early-access discount for their new book on data structures and algorithms, available through Manning's MEAP program.
Author announces a new book on data structures and algorithms, available via Manning's Early Access Program with a 50% discount.
A list of over 50 Python project ideas for beginners and advanced learners, covering algorithms, networking, and machine learning.
Explains how to sort a map's keys and values in Go, including multi-criteria sorting with code examples.
Explains the differences between Machine Learning and Generative AI, with examples and industry applications.
Final part of an Advent of Code series focusing on solving grid and graph problems in Java, with insights on API design.
Explores algorithms for generating Fibonacci numbers, from a naive recursive approach to optimized dynamic programming and iterative solutions.
Explains the modulo operation using real-world examples like days of the week, clock time, and calendar dates.
A comprehensive guide listing 76 essential technical and soft skills for software engineers to learn in 2023 to advance their careers.
Explores the difference between traditional 'parasocial media' platforms and the fediverse, arguing the latter is designed for conversation, not audience-building.
A summary of Day 2 of the Deep Dish Swift conference, covering talks on company struggles, Swift algorithms, modular architecture, mentorship, and Swift Playgrounds.
Explores efficient database methods for reordering items, inspired by Trello/Jira drag-and-drop functionality.
Explains the Insertion Sort algorithm, its implementation in JavaScript, and compares its efficiency to Bubble Sort.
An introduction to the Bubble Sort algorithm, explaining its basic concept, implementation, and its O(n^2) time complexity.
Explains how to search for a value in a Binary Search Tree (BST) using iterative and recursive approaches, covering time/space complexity.
A tutorial explaining how to implement a factorial function in JavaScript using recursion, including the base case to prevent infinite loops.
Explains iterative and recursive solutions to merge two sorted linked lists in Swift, based on LeetCode problem #21.
