AZEN-SGG/MSUStudentWork
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Сделал 13 усовершенствованную с иным заданием

Browse source
This commit is contained in:
AZEN-SGG 2024-10-18 10:00:53 +03:00
parent 5852a9f034
commit 3f5c6299fc
11 changed files with 146 additions and 5 deletions
Download patch file Download diff file Expand all files Collapse all files

4
WorkingArrays/22Ex/local_minimum.c
View file

@ -26,9 +26,9 @@ int searching_loc_min(double * numbers)
for (unsigned i = 2; i < length; ++i) {
if (numbers[i] == numbers[i - 1]) {
if (fabs(numbers[i] - numbers[i - 1]) < exp) {
if (curr_len) ++curr_len;
} else if (numbers[i] > numbers[i - 1]) {
} else if ((numbers[i] - numbers[i - 1]) > exp) {
if (curr_len) {
// It is important to remember that numbers[0] is equal to the length of the list!
start_end[0 + (min_num * 2)] = (i - curr_len), start_end[1 + (min_num * 2)] = i - 1;