Join Joe Marini for an in-depth discussion in this video Next steps, part of Programming Foundations: Algorithms.
- [Instructor] Thanks so much for watching my course.…I hope you enjoyed learning about…how to use algorithms and data structures…to solve common programming tasks.…So, what's next?…Well, now that you've learned the basics…of how to operate on various forms of data,…I have a few suggestions on where you might go from here.…As the programs you write get more complex and larger,…you'll need to think about how to best organize your code…to make it easy to maintain and understand.…So consider taking a look at Programming Foundations:…Design Patterns, which discusses various ways…of organizing your programs' internal workings.…
Another good course to consider might be…the Databases course, which is also one…of the Programming Foundations series.…As I said in the beginning, most programs…have to work on data, and that data has to be stored…and retrieved somewhere, and this course…will talk about how to do that efficiently.…Finally, you might want to take a look at…the Data Structures course, which goes into more depth…
Author
Released
11/8/2018- Measuring algorithm performance
- Working with data structures such as arrays, stacks, and queues
- Looping and recursion
- Sorting data
- Searching data
- Filtering and value counting with hash tables
Skill Level Beginner
Duration
Views
-
Introduction
-
What you should know1m 35s
-
1. Overview
-
What are algorithms?2m 44s
-
-
2. Common Data Structures
-
Arrays2m 29s
-
Linked lists2m 36s
-
Linked lists walkthrough7m 35s
-
Stacks and queues2m 43s
-
Hash tables7m 59s
-
3. Recursion
-
Understanding recursion3m 38s
-
Simple recursion example3m 9s
-
Power and factorial4m 14s
-
-
4. Sorting Data
-
Overview of sorting2m 4s
-
The bubble sort5m 8s
-
The merge sort2m 24s
-
Implement the merge sort5m 10s
-
The quicksort3m 31s
-
Implement the quicksort5m 39s
-
-
5. Searching Data
-
Unordered list search3m 45s
-
Ordered list search5m 30s
-
-
6. Other Algorithms
-
Find max value recursively3m 44s
-
Conclusion
-
Next steps1m 18s
-
- Mark as unwatched
- Mark all as unwatched
Are you sure you want to mark all the videos in this course as unwatched?
This will not affect your course history, your reports, or your certificates of completion for this course.
CancelTake notes with your new membership!
Type in the entry box, then click Enter to save your note.
1:30Press on any video thumbnail to jump immediately to the timecode shown.
Notes are saved with you account but can also be exported as plain text, MS Word, PDF, Google Doc, or Evernote.
Share this video
Embed this video
Video: Next steps