About
When tackling software performance, it's easy to prioritize hardware optimizations like CPU multithreading or GPU programming. However, a well-chosen algorithm often delivers more significant improvements than any hardware adjustment. In this lecture, we will begin by demystifying Big-O Notation, a cornerstone for evaluating algorithm efficiency. From there, we will explore algorithms tailored for array operations, starting with a comparative analysis of popular sorting techniques. Their strengths, weaknesses, and use cases will be highlighted to provide practical insights. Next, we will shift focus to the versatile "two pointers" technique, a powerful paradigm for solving complex problems involving dynamic data structures efficiently. This session is technology-agnostic, offering valuable takeaways for anyone working with dynamic data structures, regardless of their programming language or technology stack. Whether you are a physicist analyzing data or a developer optimizing code, this lecture will equip you with foundational tools for smarter problem-solving..
0:00:00 Slide 1
0:02:44 Slide 2
0:03:47 Slide 3
0:05:30 Slide 4
0:06:35 Slide 5
0:08:02 Slide 6
0:11:07 Slide 7
0:13:27 Slide 8
0:16:53 Slide 9
0:17:59 Slide 10
0:19:26 Slide 11
The talk
Credits and licence
- Institution
- CERN
- Department
- Inverted CSC
- Speaker
- Andrea Germinario
- Year
- 2025
- Language
- English
- Subjects
- Computer science
- Source
- CERN
- Licence
- CERN, as CERN states it. CERN's terms
- Attribution
- © CERN. CERN provides its audiovisual media free of charge for educational and informational use, credited to CERN; this lecture is shown in CERN's own player.
- Who can watch
- CERN gives no rating. Invisible Network shows it to Tweens profiles and older, judged from what the source says about it. How courses are placed