- 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.
- C#程序設計實訓指導書
- 深度學習經典案例解析:基于MATLAB
- Backbone.js Blueprints
- Linux Device Drivers Development
- Java Web程序設計任務教程
- QGIS By Example
- 深入淺出PostgreSQL
- Spring Boot+MVC實戰(zhàn)指南
- 軟件測試綜合技術
- 創(chuàng)意UI:Photoshop玩轉APP設計
- 零基礎學C語言(第4版)
- Getting Started with Electronic Projects
- Visual Basic程序設計基礎
- C++17 By Example
- Getting Started with Web Components