Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- // Example program
- #include <iostream>
- #include <string>
- int find_min_positive(int arr[], int size){
- int min_pos;
- // Find first positive
- for(int i = 0; i < size; i++){
- if(arr[i] >= 0){
- min_pos = arr[i];
- break;
- }
- else {
- min_pos = -1;
- }
- }
- //find min positive
- for(int i = 0; i < size; i++){
- if(arr[i] < 0)
- continue;
- if(min_pos > arr[i]){
- min_pos = arr[i];
- }
- }
- return min_pos;
- }
- int main()
- {
- // A[10] should be A[32]
- int A[10] = {-1, -2, 10, 20, 30, 1, 4, 1, 90, 8};
- std::cout << "Hello, " << find_min_positive(A, 10) << "!\n";
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement