- Python Data Structures and Algorithms
- Benjamin Baka
- 145字
- 2021-07-09 19:45:09
Arrays
An array is a sequential list of data. Being sequential means that each element is stored right after the previous one in memory. If your array is really big and you are low on memory, it could be impossible to find large enough storage to fit your entire array. This will lead to problems.
Of course, the flip side of the coin is that arrays are very fast. Since each element follows from the previous one in memory, there is no need to jump around between different memory locations. This can be a very important point to take into consideration when choosing between a list and an array in your own real-world applications.
In the latter parts of Chapter 2, Python Data Types and Structures, we looked at the array data type and discovered the various operations that could be performed on it.
- PHP 7底層設計與源碼實現
- Practical Windows Forensics
- Easy Web Development with WaveMaker
- QGIS:Becoming a GIS Power User
- Elasticsearch for Hadoop
- .NET 3.5編程
- Getting Started with Gulp
- Windows Phone 7.5:Building Location-aware Applications
- RESTful Java Web Services(Second Edition)
- Unity&VR游戲美術設計實戰
- Orleans:構建高性能分布式Actor服務
- 人工智能算法(卷1):基礎算法
- Getting Started with Polymer
- Java 從入門到項目實踐(超值版)
- Xamarin Cross-Platform Development Cookbook