Cs50 filter-less

This Pset took me days before I could sit down and write something, thanks to Reddit and Stackoverflow for helping me out, cs50 filter-less. Firstly we are told to download the problem distribution code with wget command to get stuff ready. What we are to do in this function is to write a code that will take an image cs50 filter-less convert it to a black-and-white effect.

This is CS50x , an older version of the course. See cs Perhaps the simplest way to represent an image is with a grid of pixels i. For black-and-white images, we thus need 1 bit per pixel, as 0 could represent black and 1 could represent white, as in the below. In this sense, then, is an image just a bitmap i.

Cs50 filter-less

Excellent stuff! One note though- for reflecting you don't need "two cases". So you can lose the if statements and just always rock with the first loop :. Sorry, something went wrong. Schmeargol yea it decreases code size but i think his solution is more readable however you also have a good point also great job on the blur! I would have never come up with stuff like that I think it would't work if you use break. Since the loop goes through each surrounding pixel one at a time and starts from the top left, you want the loop to continue searching for valid pixels. Because even if the current pixel is outside the image boundary, the next might be inside and with break, the loop will quit entirely without checking every neighbouring pixel. As far as my understanding of the algorithm goes, thinking that you start at the pixel index 0, 0 i and j ; the c loop will first check the pixel at location -1, -1 and it will break the loop thus increment r moving to the next column , which is fine since there are no valid pixels higer than 0,0 anyways -1, -1; -1, 0 and -1, 1.

Schmeargol yea it decreases code size but i think his solution is more readable however you also have cs50 filter-less good point also great kojak cast on the blur! Notice that you could represent a bitmap as a 2-dimensional array of pixels: where the image is an array of rows, cs50 filter-less, each row is an array of pixels. Sign in Sign up.

.

Excellent stuff! One note though- for reflecting you don't need "two cases". So you can lose the if statements and just always rock with the first loop :. Sorry, something went wrong. Schmeargol yea it decreases code size but i think his solution is more readable however you also have a good point also great job on the blur!

Cs50 filter-less

This is CS50x , an older version of the course. See cs Perhaps the simplest way to represent an image is with a grid of pixels i.

Telly express

Copy link. Excellent stuff! I might be mistaken but that is what I think would happen. You no longer need the ZIP file, so you can execute. There are a number of ways to create the effect of blurring or softening an image. Notice that you could represent a bitmap as a 2-dimensional array of pixels: where the image is an array of rows, each row is an array of pixels. Whereas programs you may have written before were confined to just one file, filter seems to use multiple files: filter. Log into cs I couldn't explain my point clearly but I tried the code with break now and it fails to blur first pixel in every column. Instantly share code, notes, and snippets. The remaining lines of the program take the resulting image and write them out to a new image file. You should not modify any of the function signatures, nor should you modify any other files other than helpers. It was very hard for me and I got stuck many times. If you run into any trouble, follow these same steps again and see if you can determine where you went wrong!

This Pset took me days before I could sit down and write something, thanks to Reddit and Stackoverflow for helping me out.

And when i refered to the locations, I refered to their i and j indexes. But on the next column, it will first check index position 0, -1 and break out of the loop, incrementing r. To review, open the file in an editor that reveals hidden Unicode characters. So long as the red, green, and blue values are all equal, the result will be varying shades of gray along the black-white spectrum, with higher values meaning lighter shades closer to white and lower values meaning darker shades closer to black. Since the loop goes through each surrounding pixel one at a time and starts from the top left, you want the loop to continue searching for valid pixels. Execute the below to evaluate the correctness of your code using check So if image represents the whole picture, then image[0] represents the first row, and image[0][0] represents the pixel in the upper-left corner of the image. Sign in to comment. For black-and-white images, we thus need 1 bit per pixel, as 0 could represent black and 1 could represent white, as in the below. To be clear, recall that a hexadecimal digit represents 4 bits. Why are these struct s useful? Copy link. You should not modify any of the function signatures, nor should you modify any other files other than helpers.