
Programming.Guide
Programming Guide provides concise articles with production-quality code examples written by expert programmers.
List of Java Exceptions | Programming.Guide
This page provides a complete list of all public exceptions and errors available in the Java API, grouped by package.
Go - programming.guide
Concurrent programming Error handling tutorial Go gotcha Gotchas Why can't I add elements to my map? What's a nil pointer dereference? Multiple values in single value context? Why …
Java - programming.guide
An index of all Java related articles on Programming.Guide. Arrays, exceptions, loops, types, and more.
Big O notation explained | Programming.Guide
Big O notation explained Big O notation is a convenient way to describe how fast a function is growing. When studying the time complexity T (n) of an algorithm it's rarely meaningful, or …
Java Arrays (with examples) - programming.guide
Java Arrays (with examples) int[] arr = new int[5]; arr[0] = 5; arr[3] = 2; // arr == [ 5, 0, 0, 2, 0 ] Arrays have fixed length. Once created, they can not be resized. In an array of length 10, the …
Hash Tables - programming.guide
Hash tables (also known as hash maps) are associative arrays, or dictionaries, that allow for fast insertion, lookup and removal regardless of the number of items stored.
Time complexity explained - programming.guide
The answer depends on factors such as input, programming language and runtime, coding skill, compiler, operating system, and hardware. We often want to reason about execution time in a …
Hash Tables: Open Addressing - programming.guide
Hash Tables: Open Addressing A hash table based on open addressing (sometimes referred to as closed hashing) stores all elements directly in the hast table array, i.e. it has at most one …
Robin Hood Hashing - programming.guide
Robin Hood Hashing Robin Hood hashing is a technique for implementing hash tables. It is based on open addressing with a simple but clever twist: As new keys are inserted, old keys are …