1 / 63

Loops and Trees

Loops and Trees. Review Arrays. I = 0; AA[I]=0; I=1; AA[I]=0; I=2; AA[I]=0; I=3; AA[I]=0; I=4; AA[I]=0;. AA. I. Review Arrays. I = 0; AA[I]=0; I=1; AA[I]=0; I=2; AA[I]=0; I=3; AA[I]=0; I=4; AA[I]=0;. AA. I. Review Arrays. I = 0; AA[I]=0; I=1; AA[I]=0; I=2; AA[I]=0;

eldora
Download Presentation

Loops and Trees

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Loops and Trees

  2. Review Arrays I = 0; AA[I]=0; I=1; AA[I]=0; I=2; AA[I]=0; I=3; AA[I]=0; I=4; AA[I]=0; AA I

  3. Review Arrays I = 0; AA[I]=0; I=1; AA[I]=0; I=2; AA[I]=0; I=3; AA[I]=0; I=4; AA[I]=0; AA I

  4. Review Arrays I = 0; AA[I]=0; I=1; AA[I]=0; I=2; AA[I]=0; I=3; AA[I]=0; I=4; AA[I]=0; AA I

  5. Review Arrays I = 0; AA[I]=0; I=1; AA[I]=0; I=2; AA[I]=0; I=3; AA[I]=0; I=4; AA[I]=0; AA I

  6. Review Arrays I = 0; AA[I]=0; I=1; AA[I]=0; I=2; AA[I]=0; I=3; AA[I]=0; I=4; AA[I]=0; AA I

  7. Review Arrays I = 0; AA[I]=0; I=1; AA[I]=0; I=2; AA[I]=0; I=3; AA[I]=0; I=4; AA[I]=0; AA I

  8. Review Arrays I = 0; AA[I]=0; I=1; AA[I]=0; I=2; AA[I]=0; I=3; AA[I]=0; I=4; AA[I]=0; AA I

  9. Review Arrays I = 0; AA[I]=0; I=1; AA[I]=0; I=2; AA[I]=0; I=3; AA[I]=0; I=4; AA[I]=0; AA I

  10. Review Arrays I = 0; AA[I]=0; I=1; AA[I]=0; I=2; AA[I]=0; I=3; AA[I]=0; I=4; AA[I]=0; AA I

  11. What if AA had 10,000 items? I = 0; AA[I]=0; I=1; AA[I]=0; I=2; AA[I]=0; I=3; AA[I]=0; I=4; AA[I]=0; AA I

  12. 2D Arrays (images)0=black, 128=gray, 255=white Img X=1; Y=1; P = Img[Y,X]; Img[Y,X] = 0; Y=2; Img[Y,X]=128; X=2; Img[Y,X]=255;

  13. 2D Arrays (images)0=black, 128=gray, 255=white Img X=1; Y=1; P = Img[Y,X]; Img[Y,X] = 0; Y=2; Img[Y,X]=128; X=2; Img[Y,X]=255;

  14. 2D Arrays (images)0=black, 128=gray, 255=white Img X=1; Y=1; P = Img[Y,X]; Img[Y,X] = 0; Y=2; Img[Y,X]=128; X=2; Img[Y,X]=255;

  15. 2D Arrays (images)0=black, 128=gray, 255=white Img X=1; Y=1; P = Img[Y,X]; Img[Y,X] = 0; Y=2; Img[Y,X]=128; X=2; Img[Y,X]=255;

  16. 2D Arrays (images)0=black, 128=gray, 255=white Img X=1; Y=1; P = Img[Y,X]; Img[Y,X] = 0; Y=2; Img[Y,X]=128; X=2; Img[Y,X]=255;

  17. 2D Arrays (images)0=black, 128=gray, 255=white Img X=1; Y=1; P = Img[Y,X]; Img[Y,X] = 0; Y=2; Img[Y,X]=128; X=2; Img[Y,X]=255;

  18. 2D Arrays (images)0=black, 128=gray, 255=white Img X=1; Y=1; P = Img[Y,X]; Img[Y,X] = 0; Y=2; Img[Y,X]=128; X=2; Img[Y,X]=255;

  19. What if the image was 1024x1024? Img X=1; Y=1; P = Img[Y,X]; Img[Y,X] = 0; Y=2; Img[Y,X]=128; X=2; Img[Y,X]=255;

  20. Strings Name I = 0; Name[I]=Name[I] – 32; I = 1; Name[I]=Name[I] – 32; I = 2; Name[I]=Name[I] – 32;

  21. Strings Name I = 0; Name[I]=Name[I] – 32; I = 1; Name[I]=Name[I] – 32; I = 2; Name[I]=Name[I] – 32;

  22. Strings Name I = 0; Name[I]=Name[I] – 32; I = 1; Name[I]=Name[I] – 32; I = 2; Name[I]=Name[I] – 32;

  23. Strings Name I = 0; Name[I]=Name[I] – 32; I = 1; Name[I]=Name[I] – 32; I = 2; Name[I]=Name[I] – 32;

  24. Strings Name I = 0; Name[I]=Name[I] – 32; I = 1; Name[I]=Name[I] – 32; I = 2; Name[I]=Name[I] – 32;

  25. Strings Name I = 0; Name[I]=Name[I] – 32; I = 1; Name[I]=Name[I] – 32; I = 2; Name[I]=Name[I] – 32;

  26. Strings Name I = 0; Name[I]=Name[I] – 32; I = 1; Name[I]=Name[I] – 32; I = 2; Name[I]=Name[I] – 32;

  27. Strings I = 0; C = Name[I]; If (C >= ‘a’ & C <= ‘z’) Name[I]=Name[I] – 32; I = 1; C = Name[I]; If (C >= ‘a’ & C <= ‘z’) Name[I]=Name[I] – 32; I = 2; C = Name[I]; If (C >= ‘a’ & C <= ‘z’) Name[I]=Name[I] – 32; Name

  28. Strings I = 0; C = Name[I]; If (C >= ‘a’ & C <= ‘z’) Name[I]=Name[I] – 32; I = 1; C = Name[I]; If (C >= ‘a’ & C <= ‘z’) Name[I]=Name[I] – 32; I = 2; C = Name[I]; If (C >= ‘a’ & C <= ‘z’) Name[I]=Name[I] – 32; Name

  29. Strings I = 0; C = Name[I]; If (C >= ‘a’ & C <= ‘z’) Name[I]=Name[I] – 32; I = 1; C = Name[I]; If (C >= ‘a’ & C <= ‘z’) Name[I]=Name[I] – 32; I = 2; C = Name[I]; If (C >= ‘a’ & C <= ‘z’) Name[I]=Name[I] – 32; Name

  30. Strings I = 0; C = Name[I]; If (C >= ‘a’ & C <= ‘z’) Name[I]=Name[I] – 32; I = 1; C = Name[I]; If (C >= ‘a’ & C <= ‘z’) Name[I]=Name[I] – 32; I = 2; C = Name[I]; If (C >= ‘a’ & C <= ‘z’) Name[I]=Name[I] – 32; Name

  31. Strings I = 0; C = Name[I]; If (C >= ‘a’ & C <= ‘z’) Name[I]=Name[I] – 32; I = 1; C = Name[I]; If (C >= ‘a’ & C <= ‘z’) Name[I]=Name[I] – 32; I = 2; C = Name[I]; If (C >= ‘a’ & C <= ‘z’) Name[I]=Name[I] – 32; Name

  32. Strings I = 0; C = Name[I]; If (C >= ‘a’ & C <= ‘z’) Name[I]=Name[I] – 32; I = 1; C = Name[I]; If (C >= ‘a’ & C <= ‘z’) Name[I]=Name[I] – 32; I = 2; C = Name[I]; If (C >= ‘a’ & C <= ‘z’) Name[I]=Name[I] – 32; Name

  33. Strings I = 0; C = Name[I]; If (C >= ‘a’ & C <= ‘z’) Name[I]=Name[I] – 32; I = 1; C = Name[I]; If (C >= ‘a’ & C <= ‘z’) Name[I]=Name[I] – 32; I = 2; C = Name[I]; If (C >= ‘a’ & C <= ‘z’) Name[I]=Name[I] – 32; Name

  34. Strings I = 0; C = Name[I]; If (C >= ‘a’ & C <= ‘z’) Name[I]=Name[I] – 32; I = 1; C = Name[I]; If (C >= ‘a’ & C <= ‘z’) Name[I]=Name[I] – 32; I = 2; C = Name[I]; If (C >= ‘a’ & C <= ‘z’) Name[I]=Name[I] – 32; Name

  35. Strings I = 0; C = Name[I]; If (C >= ‘a’ & C <= ‘z’) Name[I]=Name[I] – 32; I = 1; C = Name[I]; If (C >= ‘a’ & C <= ‘z’) Name[I]=Name[I] – 32; I = 2; C = Name[I]; If (C >= ‘a’ & C <= ‘z’) Name[I]=Name[I] – 32; Name

  36. Strings I = 0; C = Name[I]; If (C >= ‘a’ & C <= ‘z’) Name[I]=Name[I] – 32; I = 1; C = Name[I]; If (C >= ‘a’ & C <= ‘z’) Name[I]=Name[I] – 32; I = 2; C = Name[I]; If (C >= ‘a’ & C <= ‘z’) Name[I]=Name[I] – 32; Name

  37. Strings I = 0; C = Name[I]; If (C >= ‘a’ & C <= ‘z’) Name[I]=Name[I] – 32; I = 1; C = Name[I]; If (C >= ‘a’ & C <= ‘z’) Name[I]=Name[I] – 32; I = 2; C = Name[I]; If (C >= ‘a’ & C <= ‘z’) Name[I]=Name[I] – 32; Name

  38. Strings I = 0; C = Name[I]; If (C >= ‘a’ & C <= ‘z’) Name[I]=Name[I] – 32; I = 1; C = Name[I]; If (C >= ‘a’ & C <= ‘z’) Name[I]=Name[I] – 32; I = 2; C = Name[I]; If (C >= ‘a’ & C <= ‘z’) Name[I]=Name[I] – 32; Name

  39. Strings I = 0; C = Name[I]; If (C >= ‘a’ & C <= ‘z’) Name[I]=Name[I] – 32; I = 1; C = Name[I]; If (C >= ‘a’ & C <= ‘z’) Name[I]=Name[I] – 32; I = 2; C = Name[I]; If (C >= ‘a’ & C <= ‘z’) Name[I]=Name[I] – 32; Name

  40. For Loops Name For (each index I in Name) { C = Name[I]; If (C>=‘a’ & C<=‘z’) { Name[I]=Name[I] - 32; } }

  41. For Loops Name For (each index I in Name) { C = Name[I]; If (C>=‘a’ & C<=‘z’) { Name[I]=Name[I] - 32; } }

  42. For Loops Name For (each index I in Name) { C = Name[I]; If (C>=‘a’ & C<=‘z’) { Name[I]=Name[I] - 32; } }

  43. For Loops Name For (each index I in Name) { C = Name[I]; If (C>=‘a’ & C<=‘z’) { Name[I]=Name[I] - 32; } }

  44. For Loops Name For (each index I in Name) { C = Name[I]; If (C>=‘a’ & C<=‘z’) { Name[I]=Name[I] - 32; } }

  45. For Loops Name For (each index I in Name) { C = Name[I]; If (C>=‘a’ & C<=‘z’) { Name[I]=Name[I] - 32; } }

  46. For Loops Name For (each index I in Name) { C = Name[I]; If (C>=‘a’ & C<=‘z’) { Name[I]=Name[I] - 32; } }

  47. For Loops Name For (each index I in Name) { C = Name[I]; If (C>=‘a’ & C<=‘z’) { Name[I]=Name[I] - 32; } }

  48. For Loops Name For (each index I in Name) { C = Name[I]; If (C>=‘a’ & C<=‘z’) { Name[I]=Name[I] - 32; } }

  49. For Loops Name For (each index I in Name) { C = Name[I]; If (C>=‘a’ & C<=‘z’) { Name[I]=Name[I] - 32; } }

  50. For Loops Name For (each index I in Name) { C = Name[I]; If (C>=‘a’ & C<=‘z’) { Name[I]=Name[I] - 32; } }

More Related