tag

#testing

2 pages tagged

Programming › Algorithm Cookbook › Chapter 6. Sorting ›

6.23 Testing Sort Correctness

6.23 Testing Sort Correctness Sorting implementations are easy to get almost right and hard to get completely correct. Subtle bugs often appear only on edge cases, duplicate-heavy inputs, or adversarial patterns. A disciplined testing strategy verifies both the ordering and permutation properties under a wide range of inputs. Problem You have implemented a sorting algorithm. You want to verify that it is correct, stable when required, and robust across inputs....

Programming › Algorithm Cookbook › Chapter 5. Hashing and Maps ›

5.20 Testing Hash Logic

5.20 Testing Hash Logic Problem You need confidence that a hash-based structure is correct, stable, and performs well under realistic inputs. Hash table bugs are often subtle. A map may pass small examples but fail after resizing. A set may work until keys collide. A deterministic hash may appear stable until another language, platform, or encoding rule is introduced. Solution Test both logical behavior and structural stress cases. Basic behavior:...