Section 3.1 # 6
Describe an algorithm that takes as input a list of n integers and finds the number of negative integers in the list
list Number Of Negative (a1, a2,…an)
i = 1 to n
N = number of negative numbers = 0
if ai < 0
N = N + 1
Return N
Header Image
Creative Commons image courtesy of Flickr user StormPetrel1-
Recent Posts
Recent Comments
- In the Spotlight: MAT2540 – Discrete Structures and Algorithms II – The Open Road on Links
- OpenLab Workshop for Opening Gateways Fellows | 2018-2019 Opening Gateways Faculty Seminar on Final Exam Review
- Eric on Eric’s Final Review
- Kate Poirier on Hints/reminders from today’s class
- Kate Poirier on Final Exam Review
Archives
Categories
Meta
Looks pretty good Francisco. To be super clear, be sure to use “:=” for assignments so that you can save “=” for equality. Also, don’t forget the word “for” in your “for i :=1 to n.”