Write code in C++ In a unidirectional list of n items, find:

A. The smallest element in the list by absolute value;

B. The sum, in absolute value, of the elements following the first negative element.

Compress the list by removing from it all the elements in the interval [a;b].

Algorithm to find smallest element of array

Let it be N. Then ask user to enter N numbers and store it in an array(lets call it inputArray). Initialize one variables minElement with first element of inputArray. Using a loop, traverse inputArray from index 0 to N -1 and compare each element with minElement.

Explanation:

ok that sounds like a app that my brother would like

leaning back,   no eye contact,   fidgeting in the seat