How many integers can I create in 1GB memory?
In book Algorithms fourth edition by Robert Sedgewick on page 200, it says "for example, if you have 1GB of memory on your computer (1 billion bytes), you cannot fit more than about 32 million int values."
I got confused after my calculation: 1,000,000,000 bytes/4 bytes = 250 million
How the author got 32 million?
The book describes like below:
Solution
The author has acknowledged that this is an error in this book website, please refer to the link as follows: http://algs4.cs.princeton.edu/errata/errata-printing3.php
- Representing a Range of values in Python
- How to restructure instance segmentation predictions into a custom dictionary format in Python?
- How to store items in the LIFO stack in a cache-friendly manner?
- Efficient Merge sort implementation in python
- In C: Created a node, forgot return the pointer to the node, but code still runs as if I returned it
- Attribute error : None type object in Linked List
- How to get the first value greater than x in a range with segment tree
- Understanding Disk Reads and Cache Misses for B-tree and BST Queries
- a collection data structure to keep items sorted
- What are Pascal Strings?
- Using a LinkedList or ArrayList for iteration
- Red Black Tree Black Height Increase after Insertion
- What would a "frozen dict" be?
- Merging two sorted linked lists
- Does a recursive segment tree require more space than an iterative one?
- Is there a balanced BST with each node maintain the subtree size?
- Advantage of B+ trees over BSTs?
- How can I develop a class to return unique numbers in the specified range?
- What is the best way to combine two lists into a map in Java?
- Implementing Data tree Structures in Unreal Engine
- Does JavaScript have an implementation of a set data structure?
- The simplest algorithm for poker hand evaluation
- Efficient way to compare two arrays
- Hashmap using Binary search tree incorrect implementation?
- How to safely implement "Using Uninitialized Memory For Fun And Profit"?
- What is the most efficient way to represent the infinite tape of a Turing machine in Python?
- Non-read only alternative to anonymous types
- Line management in a text editor
- Find two furthest points in a point set in linear time (2-approximation algorithm)
- Why not use hashing/hash tables for everything?