Hello please your solution didn't match with a question I got.. Take for example from step 1 you have (1,15) (0,19) and (1,4). When you apply step 2 with your solution, you'll get log 3 base 2 = 0.176 which is not the actual number of bits. Kindly explain
in CS, everything is base 2. think of everything as 2^x. in math class, you dont see the number because log base 10 is implied, but written out fully you would put log10 8. the two is just showing the base.
NOTE : for simplicity i took small string that is why final code is larger than input string
Great video,,,thumbs up.
Thankyou so much. And also thankyou for using English. May God bless you in Jesus Christ's mighty name AMEN.
Sir.. Final code seems larger than original code.. Then how can we say it is compressed..?
That is the worst case of RLE. When your text changes very fast, RLE opeartes bad. So it is an encoding method rather than compressing method.
for simplicity i took small string that is why final code is larger than input string
thank you so much
Hello please your solution didn't match with a question I got.. Take for example from step 1 you have (1,15) (0,19) and (1,4). When you apply step 2 with your solution, you'll get log 3 base 2 = 0.176 which is not the actual number of bits. Kindly explain
what are u asking??? what you asked is not in the explanation...what is it??
Tnx bro tmrw is my exam😃
welcome mate cheers
WRONG EXPLANATION
If there were 10 zeroes at first how would you represent it in 3 bits
8 term bana hai isliye log 8 base2 = 3
KUCH BHIII ?!
2:02 where did you get the 2 from?
in CS, everything is base 2. think of everything as 2^x. in math class, you dont see the number because log base 10 is implied, but written out fully you would put log10 8. the two is just showing the base.
Tq bro