|
|
|
|
| LEADER |
02370nmm a2200397 u 4500 |
| 001 |
EB001921647 |
| 003 |
EBX01000000000000001084549 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
210123 ||| eng |
| 050 |
|
4 |
|a QA76.73.J38
|
| 245 |
0 |
0 |
|a From 0 to 1
|b data structures & algorithms in Java
|c Loonycorn
|
| 246 |
3 |
1 |
|a Data structures and algorithms in Java
|
| 246 |
3 |
1 |
|a From zero to one
|
| 260 |
|
|
|a [Place of publication not identified]
|b Packt Publishing
|c 2017
|
| 300 |
|
|
|a 1 streaming video file (15 hr., 1 min., 7 sec.)
|
| 653 |
|
|
|a Algorithms
|
| 653 |
|
|
|a Java (Computer program language) / fast / (OCoLC)fst00982065
|
| 653 |
|
|
|a Algorithms / http://id.loc.gov/authorities/subjects/sh85003487
|
| 653 |
|
|
|a Algorithmes
|
| 653 |
|
|
|a Data structures (Computer science) / http://id.loc.gov/authorities/subjects/sh85035862
|
| 653 |
|
|
|a algorithms / aat
|
| 653 |
|
|
|a Algorithms / fast / (OCoLC)fst00805020
|
| 653 |
|
|
|a Java (Langage de programmation)
|
| 653 |
|
|
|a Java (Computer program language) / http://id.loc.gov/authorities/subjects/sh95008574
|
| 653 |
|
|
|a Structures de données (Informatique)
|
| 653 |
|
|
|a Data structures (Computer science) / fast / (OCoLC)fst00887978
|
| 710 |
2 |
|
|a Loonycorn
|
| 710 |
2 |
|
|a Packt Publishing
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b OREILLY
|a O'Reilly
|
| 500 |
|
|
|a Title from resource description page (Safari, viewed November 9, 2017)
|
| 856 |
4 |
0 |
|u https://learning.oreilly.com/videos/~/9781788626767/?ar
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 500
|
| 082 |
0 |
|
|a 000
|
| 520 |
|
|
|a "This is an animated, visual and spatial way to learn data structures and algorithms. Our brains process different types of information differently - evolutionary we are wired to absorb information best when it is visual and spatial i.e. when we can close our eyes and see it. More than most other concepts, Data Structures and Algorithms are best learned visually. These are incredibly easy to learn visually, very hard to understand most other ways. This course has been put together by a team with tons of everyday experience in thinking about these concepts and using them at work at Google, Microsoft and Flipkart What's Covered: Big-O notation and complexity, Stacks, Queues, Trees, Heaps, Graphs and Graph Algorithms, Linked lists, Sorting, Searching."--Resource description page
|