# Category Archives: Test #1 Review

## 3.1 #25

Posted in Test #1 Review | 1 Comment

## Test#1 Review-Jose Betance

Posted in Test #1 Review | 1 Comment

## Test #1 Review 3.3#4

:-\$

Posted in Test #1 Review | 1 Comment

## Test #1 Review

3.3 #30

Posted in Test #1 Review | 1 Comment

## Test #1 Review

Devise an algorithm that finds the sum of all the integers in a list procedure sum (a1, a2,…,an:integers) sum = an for i to an -1 sum= sum + an return sum;

Posted in Test #1 Review | 2 Comments

## Test # 1 Review – Francisco Tamay

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 = … Continue reading

Posted in Test #1 Review | 1 Comment

## Test_1_review_Javier_Joya

Test_1_review_Javier_Joya

Posted in Test #1 Review | 2 Comments

## Test #1 Review – [Benjamin Lin] section 3.1 #20

Code: Find max and min (a1,a2…..an) max = min = ai i = 2 from ( i to n) if ai < min min = ai if ai> max max = ai return min, max

Posted in Test #1 Review, Uncategorized | 1 Comment

## Test #1 Review – Brian Gil

Section 3.3 = #3 Give a big-θ estimate for the number of operations of this algorithm: m := 0 for i := 1 to n for j := i +1 to n m := max(aiaj, m)   The values of i and … Continue reading

Posted in Test #1 Review | 1 Comment

## Review

Posted in Test #1 Review | 6 Comments