August 2024
Intermediate to advanced
516 pages
11h 47m
English
Content preview from A Common-Sense Guide to Data Structures and Algorithms in JavaScript, Volume 1
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.
Ignoring Constants
But here’s the funny thing: in the world of Big O notation, Selection Sort and Bubble Sort are described in exactly the same way.
Again, Big O notation answers the key question: if there are N data elements, how many steps will the algorithm take? Because Selection Sort takes roughly half of N2 steps, it would seem reasonable that we’d describe the efficiency of Selection Sort as being O(N2 / 2). That is, for N data elements, there are N2 / 2 steps. The following table bears this out:
N Elements | N2 / 2 | Max # of Steps in Selection Sort |
|---|---|---|
5 | 52 / 2 = 12.5 | 14 |
10 | 102 / 2 = 50 | 54 |
20 | 202 / 2 = 200 | 209 |
40 | 402 / 2 = 800 | 819 |
80 | 802 / 2 = 3200 | 3239 |
In reality, however, Selection Sort is described in Big O as O(N2), just like Bubble Sort. This is because ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access
More than 5,000 organizations count on O’Reilly
O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.Julian F.
I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.Addison B.
I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.Amir M.
I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.