u da real algorithm, byte, recursion, stack vs queue, big O notation
2026-04-06 23:18:15
259
𝐌𝐨𝐡𝐚🥥 :
I'm not a CS major but an algorithm is like a sequence of oredes or command of things to do to go from A to B there is 8 bits in a bytes I think and the big isn't like the complexity or the time it takes for an algorithm to process?
2026-04-06 23:03:49
6
hyu :
You da real question (I’m sorry)😭
2026-04-06 23:13:36
79
Kleines Mausi :
1. Finite steps of instruction to solve a problem, that terminate in a finte amount of time
2. 8
3. self reference, eg. a function calls itself until it hits a base case
4. A stack is LIFO (last in first out) and a queue is FIFO (first in first out) which changes time complexity for manipulating data at given indices (most noticeable start and end)
5. Big O notation refers to classes of complexity, to measure an algorithm, by an upper bound (for example time or space complexity)
2026-04-08 20:43:26
22
Cleo :
U guys best know the answer to these 🤨 🎤
2026-04-06 23:33:41
31
★~𖤐 jxv.official𖤐~★ :
I'm twelve why is this on my fyp, Ive decided on cs but bro, why IS IT APPEARING ON MY FEED NOWWW
2026-04-25 21:43:05
2
Throwawa32 :
1. a set of step by step instructions to solve a task 2. 8 3. self referential calling with a anchor 4. lifo vs fifo 5. asymptotic worst case cost (usually in time complexity or storage space)
2026-04-07 08:57:31
11
ゼフィリアン :
lost me with question two
2026-04-06 23:05:00
14
Idk :
1- algorithm is a A well ordered collection of unambiguous and effectively computable operations that when executed produces results and halts in a finite amount of time 2- 8 bits in one byte 3- recursion is when a function calls itself over and over to solve a problem 4- Stack is like a plate pile last one added comes off first Queue is a lin first person added goes first 5-Big O notation tells you how an algorithm slows down as you give it more data to handle
2026-04-08 02:20:31
3
chirik SHERSHN EW :
easiest questions ever
2026-04-09 10:20:25
0
KZ :
If you can't answer these, then drop CS
2026-05-24 11:55:44
1
HangXediT :
things I heard but never knew ! 😁✨🍀
2026-05-24 08:51:38
2
nafella :
i only can answer 2 question🗿
2026-04-07 03:52:39
0
Your Boyfriend :
u da real cs major
2026-04-07 01:01:59
2
PieceOfTrash :
4 one is a stack of plates in a hole or chips in a pringle can, while the other is a line to the carousel or a car lineup in a tunnel.
you can only work with the top of a stack and need to get each node out to go deeper, you can see both ends and go through either way of a queue
i may be wrong, dont trust me, still learning and i hate algorythms
2026-04-08 15:52:36
1
ian :
u da real 5
2026-04-06 23:11:37
2
Simple_acz :
I m not in programming but still I know 2 ans.Am I smart?😁
2026-04-07 05:20:29
1
Ysxn :
yeah bro I am cooked
2026-04-06 23:07:39
1
Azan :
Step by step to Solve a problem, 8, function calling itself, lifo and fifo. Measures an algorithms time and space complexity. easy.
2026-06-04 01:43:13
0
Nabil :
1. it's a steps to solve a problem
2. we have 8 bits in 1 byt
3. a function call it self
4. first in last out and first in first out
I forget the last one 😁
also if you are use heigh level programming language and library you will not need any of these 🤣
2026-06-02 00:01:12
0
Mohammad sultani :
and number 6 Qs is why r u so beautiful 😍 😁
2026-05-22 11:43:14
0
Kim khan :
most stuck questions ?? 😅😅😅😂
2026-05-20 09:56:42
0
Shipi :
U da real question twin
2026-04-06 23:24:24
0
To see more videos from user @ih8chz, please go to the Tikwm
homepage.