Lorraine
Region: US
Friday 13 May 2022 04:03:02 GMT
47029
2119
76
34
Music
Download
Comments
bigboland41 :
All arrays are fixed length, some languages just have dynamic arrays built in so when they get full they will make a new bigger array
2022-05-13 11:43:22
7
mochacccino :
Thanks for sharing. What is a good resource to learn about other data structures?
2022-05-13 04:37:18
4
sumo :
What languages don’t have fixed length arrays?
2022-05-13 07:50:56
2
Armand le charmand :
"the data structure that used the most" 😑😑😑😑😑😑😑😑
2022-05-13 07:55:20
4
MohyCS :
I think you meant Lists 😂 since Arrays have a fixed size?
2022-05-13 16:26:23
1
daleparse :
Psst. Hey kid you want some better time complexity. Heres some splits/dividers! All the cool kids are doing it now.
2022-05-13 18:33:04
1
Josh Oyugi :
I don't know where I heard this but I think for "modern languages" when adding an elements.... it copies the whole array pastes it after adding the
2022-05-13 18:40:57
0
shinchan.in :
@meena
2022-05-13 16:44:21
0
. :
Lmao who made this. Insertion is a constant time operation.
2022-05-13 15:39:49
0
Khalid :
insert is O(1) and O(n) for sorted
2022-05-13 11:31:16
2
Oloap :
You can insert/remove from the end in (mostly) O(1) time
2022-05-17 03:59:51
1
Sam :
assumed time complexities***
2022-05-13 18:00:37
0
.. :
bruh what
2022-05-24 08:47:57
0
. :
Thx
2022-05-18 19:17:01
0
Bob the builder :
Could you do the same for all the different DS&A?
2022-05-15 11:09:53
0
sweet spiderling :
Me using numpy and never thinking about any of this: wat?
2022-05-14 17:35:36
0
Dritte Dimension :
n-1
2022-05-13 20:22:16
0
Dami :
Last one should be Binary Search, you can still have a O(n) search on a sorted list if implemented naively.
2022-05-13 18:58:12
0
itssarahonthisapp :
hash map
2022-05-13 11:47:04
0
BobWeirdick :
I could have used this last aemester
2022-05-13 06:27:51
0
To see more videos from user @lorraineleung_, please go to the Tikwm
homepage.
