From ca1cad9bfce5f13d752cca4e7e98a7c67f3b7228 Mon Sep 17 00:00:00 2001 From: "github-actions[bot]" <41898282+github-actions[bot]@users.noreply.github.com> Date: Fri, 3 Jan 2025 22:53:12 +0600 Subject: [PATCH] chore: update roadmap content json (#7969) Co-authored-by: kamranahmedse <4921183+kamranahmedse@users.noreply.github.com> --- public/roadmap-content/computer-science.json | 26 +++++++++++++++++--- 1 file changed, 23 insertions(+), 3 deletions(-) diff --git a/public/roadmap-content/computer-science.json b/public/roadmap-content/computer-science.json index 3e01868a3125..e6c58d6500dc 100644 --- a/public/roadmap-content/computer-science.json +++ b/public/roadmap-content/computer-science.json @@ -835,6 +835,11 @@ "url": "https://www.bigocheatsheet.com/", "type": "article" }, + { + "title": "Big O Notation | Brilliant Math & Science Wiki", + "url": "https://brilliant.org/wiki/big-o-notation/", + "type": "article" + }, { "title": "Big O Notation — Calculating Time Complexity", "url": "https://www.youtube.com/watch?v=Z0bH0cMY0E8", @@ -854,13 +859,18 @@ }, "c-NrTtJuNihbHzyPEOKTW": { "title": "Big O", - "description": "Big O Notation describes, how well an algorithm scales with the input size. It is used to describe the worst case scenario of an algorithm. It is used to compare algorithms and to determine which algorithm is better.\n\nVisit the following resources to learn more:", + "description": "The Big O notation can be used to describe how the running time of an algorithm scales with the growth of the input size, ignoring implementation details such as programming language and computer speed. Specifically, it denotes the upper bound of the growth rate of a function that relates the running time of an algorithm to its input size. It can be used to compare algorithms and determine which one is better.\n\nVisit the following resources to learn more:", "links": [ { "title": "moviesCS 61B Lecture 19: Asymptotic Analysis", "url": "https://archive.org/details/ucberkeley_webcast_VIS4YDpuP98", "type": "article" }, + { + "title": "Big O Notation | Brilliant Math & Science Wiki", + "url": "https://brilliant.org/wiki/big-o-notation/", + "type": "article" + }, { "title": "Big O Notation — Calculating Time Complexity", "url": "https://www.youtube.com/watch?v=Z0bH0cMY0E8", @@ -880,8 +890,13 @@ }, "ThLpVZQIJ4diY5m0dik8m": { "title": "Big-Theta", - "description": "While Big O Notation refers to the upper bound of a function, Big Theta Notation refers to the exact bound of a function. Big Theta Notation is used to describe the exact growth rate of a function. It is denoted by the symbol Θ.\n\nVisit the following resources to learn more:", + "description": "If a function has the same Big O and Big Omega, they also become the function's Big Theta. Big Theta is used to describe the exact growth rate of a function. It is denoted by the symbol Θ.\n\nVisit the following resources to learn more:", "links": [ + { + "title": "Big O Notation | Brilliant Math & Science Wiki", + "url": "https://brilliant.org/wiki/big-o-notation/", + "type": "article" + }, { "title": "Big Oh Notation (and Omega and Theta)", "url": "https://www.youtube.com/watch?v=ei-A_wy5Yxw&list=PL1BaGV1cIH4UhkL8a9bJGG356covJ76qN&index=3", @@ -896,8 +911,13 @@ }, "X33735aeAVSlJ6yv9GS-h": { "title": "Big Omega", - "description": "Big Omega notation is used to describe the lower bound of a function. It is the opposite of Big O notation. While Big O is used to describe the worst case scenario of an algorithm, Big Omega is used to describe the best case scenario of an algorithm.\n\nVisit the following resources to learn more:", + "description": "The Big Omega notation is similar to the Big O notation. The only difference is that it denotes the lower bound on the growth rate of a function.\n\nVisit the following resources to learn more:", "links": [ + { + "title": "Big O Notation | Brilliant Math & Science Wiki", + "url": "https://brilliant.org/wiki/big-o-notation/", + "type": "article" + }, { "title": "Big Oh Notation (and Omega and Theta)", "url": "https://www.youtube.com/watch?v=ei-A_wy5Yxw&list=PL1BaGV1cIH4UhkL8a9bJGG356covJ76qN&index=3",