狠狠撸

狠狠撸Share a Scribd company logo

配列の要素挿入?削除もランダムアクセスも両方高速にできる？

?
?
Hiro H.
Hiro H.

This document discusses C++ data structures including vectors, lists, and STL. It provides examples of inserting elements into vectors with indexes between 0 and 10000 as well as 5000. Balanced binary search trees and hash tables are also mentioned. Links are provided to additional resources on C++ STL and data structures.

1 of 18
Download to read offline
2019.5.25 #48 H.Hiro
H.Hiro / Maraigue ? Twitter: @h_hiro_ ? ? C++ ? Ruby
? ? C++ vector list ? Java ArrayList LinkedList ? [C++] STL - Qiita https://qiita.com/h_hiro_/items/a83a8fd2391d4a3f0e1c ?
(1/4) ? 10000 5000 ( ) ? ? 0 1 2 9997 9998 99994999 5000 5001
(1/4) ? 10000 5000 ( ) ? ? 0 1 2 9997 9998 99994999 5000 5001 0 1 2 9997 9998 99994999 5000 5001
(1/4) ? 10000 5000 ( ) ? ? 0 1 2 9997 9998 99994999 5000 5001 0 1 2 9997 9998 99994999 5000 5001 0 1 2 4999 5001 9998 99995002 4999
(2/4) ? ? 0 1 2 9997 9998 99994999 5000 5001
(2/4) ? ? 0 1 2 9997 9998 99994999 5000 5001 0 1 2 9997 9998 99994999 5001
(3/4) ? ( ) ? ? 0 1 2 9997 9998 99994999 5001 5000 5000 4998
(4/4)
? ?
0 2 4 6 3 1 5
? ? 0 1 2 3 4 5 6 0 2 4 6 3 1 5
? ? ? AVL 0 2 4 6 3 1 5
? ? ? ? 0 2 4 6 3 1 5
C++ ? map ? C++11 unordered_map ? unordered_map 0 2 4 6 3 1 5
? ? ? ? kaiseh https://kaiseh.hatenadiary.org/entry/20071231/1199122020
0 1 2 9997 9998 99994999 5000 5001 0 1 2 9997 9998 99994999 5000 5001 0 1 2 4999 5001 9998 99995002 4999

More Related Content

配列の要素挿入?削除もランダムアクセスも両方高速にできる？