Dictionaries - Introduction to Data Structures (Episode 8)
ฝัง
- เผยแพร่เมื่อ 1 ต.ค. 2024
- Today we discuss both dictionaries and hash tables as we continue to work our way through the wacky world of data structures.
1:34 - Introduction
2:50 - Properties of Dictionaries
4:54 - Hash Tables and Hash Functions
8:10 - Example Hash Function
12:00 - Time Complexity Equations
------------------------------------------------
Introduction to Data Structures Playlist: • Introduction to Data S...
------------------------------------------------
Sources for today's Episode:
computerscienc...
en.wikibooks.o....
realpython.com...
www.geeksforge...
brilliant.org/....
towardsdatasci...
www.hackereart....
en.wikipedia.o...
en.wikipedia.o...
en.wikipedia.o...
-----------------------------------------------------------------
NullPointerException is a TH-cam channel created by two high-schoolers in hopes of creating high-quality tutorial and how-to's relating to computer science and programming. Videos can range from basic language tutorials, specific programming how-to's, and even some AP course review when the time hits. If this at all interests you, consider subscribing to expand your programming knowledge.
Subscribe to NPE: / @nullpointerexception ---------
Support Us: www.buymeacoff...
1.
s = input()
l = s.split(" ")
print("Broj riječi u rečenici: " + str(len(l)))
#s.replace("a", "")
#print("Rečenica bez slova 'a': " + s)
novi = ""
for i in range(len(s)):
if (s[i] != "a"):
novi = novi + s[i]
print("Rečenica bez slova 'a': " + novi)
br = 0
for i in range(len(s)):
if (s[i].isupper()):
br = br + 1
print("Broj velikih slova u rečenici: " + str(br))
rj = {}
for i in range(len(l)):
rj[len(l[i])] = l[i]
print(rj)
thank you so much keep going , I wish there is a series dedicated to algorithms thanks again
This is the best video for dictionaries and hash tables. Thank you very much !
Glad you liked it!
Thank you for this series, everything is really helpful so far! I appreciate it!
thank you for such an explanation
love from india!
Glad it was helpful!
Do keys can be floats??
Wow.... !!! Your representation is Awesome and Conceptual......👍👍👍
Thank you so much 😀
this is such an amazing video - clear , simple , in detail and colourful. could not have asked for anything more - you have just saved my exam grade. if only all teachers were like you !
thank you,
is mongoDb using dictionary concept?
Thank you! This is very helpful
i want to translate it in arabic , it`s great
Gotta say........ I'm IMPRESSED!! Great content...glad I found it sooner!
Atleast sooner than future visiters👻
Welcome aboard!
Wow what a high quality video... Amazing work.
3.
print("Upisite prirodan broj n:")
n = int(input())
rj = {}
print("Upisite " + str(n) + " prirodnih brojeva: ")
for i in range(n):
x = input()
brojZnamenki = 0
for j in x:
brojZnamenki = brojZnamenki + 1
rj[brojZnamenki] = x
listaKljuceva = list(rj.keys())
listaKljuceva.sort()
for i in range(n):
kljuc = listaKljuceva[i]
print(str(kljuc) + ": " + rj[kljuc])
Thank You So Much...
very well explained
Isn't open and closed hashing terminology vice versa?
Open Addressing is the same as closed hashing, and closed addressing is the same as open hashing. Not sure why they decided that wouldn't be a confusing naming convention.
Thank you!
Wonderfull tutorial.
Thnxalot ❤️❤️
Great video!
Sean would be so mad😂😂😂 is he your friend?
Haha sean and I are friends in real life so we like to just poke fun at each other in our videos.
you're a life saver!
your way of teaching is awesome. like beloved prof messer
Glad to hear that. Thank you for the compliment!