A forever-learner and explorer. |�y������#�� cs50. endstream endobj 410 0 obj <>stream [A��9H�35i�\���I3_ڔ� ��#� Home; Blog. Fewest forks hތV�o�6�W�1���!�����c�a���X6��ڬ#L�I)��~wGQ��t���q����LJ͢�IeX�H��-�B1I&m` K��)Gs��}�}����*���^��t��K-�~\}���¾U�`�`�g�a�-��U(�����e}�;����Ǐx�ݸ������?\�G�-��=\L6�Wwɳ���r;�f��L�5NRi�t>�\Ϥ���{Wn�{f�g�����mUl;��mS���͏�JE[pZKԶ���bWV�����XV�[,/�FY9�d Keep going we got this! This course teaches students how to think algorithmically and solve problems efficiently. I like how you write up your summaries, as I don’t want to cheat but sometimes need a little push and help.Thanks, @inline-five for your feedback and link; that’s super helpful as I’m just settling into the reflect task. This course teaches students how to think algorithmically and solve problems efficiently. I'm Becky welcome to my super awesome blog about my journey in life. Why did no one tell me? Here is what I wrote out.For the filter, you want to find out what each value of R, G and B is per pixel so therefore you must iterate through the first row of the bitmap image.Then you iterate again through each individual column in that row to collect the values of R, G, B per bit.As provided by cs50, we know that to access the pixels in the 2D array we do: Then you added them together divide by 3 to find the average. etc etc. Recently updated !Thanks for these walkthroughs Bexa – I’ve found them really useful to check my Sudocode since I started CS50.I am getting the same irritating message as you did – linker command failed with exit code 1 and I can’t fix it. A little insight might help.First I like how u sharing and helping ppl with this for (j = 0; j -1) && (0 => j -1 ) && (0 => i <= height)){ // check if there is a column to the right (6) // check if there is a row below pixel (0) // if there is a bottom left corner (3) // if there is a bottom right corner (8) newImage[i][j].rgbtRed = round(sumRed / counter); /*replace old image with new blurred pixels/* !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! All gists Back to GitHub.
CS50 presents CS50x Puzzle Day with special thanks to our friends at Facebook x This packet contains 8 puzzles, each of which is independent of the others. �w�K�O��K��LI�+�,����.M*�,H��!��y�@E�@=F`= q}�1vv �z(� (if you do that then it will blur the already blurred pixels).So, I tried many methods and they just wouldn’t work and finally after months of scratching my eye out, I reached out to someone on twitter who told me his pseudocode. In the video he mentions if it’s an even number we can directly halve with no remainders but if it’s an odd it would become a decimal.Good thing with integars is that if the decimal is .5 or below it rounds DOWN. h4T0P���w�/�+Q����L)��4 This allowed me to use the printf function to print out each pixel’s RGB\n and see where the program was getting the values from. I’ve done the first 3, working on blur. duplicate entire image so you can blur the new values.
This was probably the hardest problem set (so far). p.s WELL DONE FOR PASSING PSET4 ^_^ h�24�T0P���wJ,Nu��+��q���vN��L*��u��I�wI-NN�KI�+))V041� You check each side, then the corners and then you add the middle pixel tooAfter that you should be tallying up each colour and averaging them (to get the blur)Then I started getting compilation errors saying it was too large or over the 255 max value RGB can be. I’m cringing so much as I go through all my posts to update the word According to the video; for each pixel, which is 8 bytes or 1 bit, there are 3 colours, RGB and in order to convert it to greyscale, you need all the values of R, G and B to be the same. I am stuck myself too. Amazingly I was able to get it to work. h��j�0�_Eo`[N�J`M���ɭ�R1 Z'����Hi�)i���n�x�mvfvgV(�Z���;�8M���-�m�-l��#(� �b����u����زq� All but the "capstone" folder are from the assignments and thus are not open-sourced they are open courseware from Colten Odgen(Repo colection for all the projects from the CS50 game-dev courseCS50 is Harvard University's introduction to the intellectual enterprises of computer science and the art of programming for majors and non-majors alike, with or without prior programming experience.