Emil_Shanaty/SimplexTASK
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

update test cases and format code

Browse Source
This commit is contained in:
Ilya Grigorev
2024-10-09 14:09:48 +05:00
parent a41c15f3ee
commit 60bd99e570
8 changed files with 485 additions and 363 deletions
Download Patch File Download Diff File Expand all files Collapse all files
tools/math.cpp
+58 -30
View File
@@ -1,39 +1,50 @@
#include "math.h"
double min(Vector vector) {
double min(Vector vector)
{
double temp = vector[0];
for (int j = 0; j < vector.size(); j++) {
if (vector[j] < temp) {
for (int j = 0; j < vector.size(); j++)
{
if (vector[j] < temp)
{
temp = vector[j];
}
}
return temp;
}
double max(Vector vector) {
double max(Vector vector)
{
double temp = vector[0];
for (int j = 0; j < vector.size(); j++) {
if (vector[j] > temp) {
for (int j = 0; j < vector.size(); j++)
{
if (vector[j] > temp)
{
temp = vector[j];
}
}
return temp;
}
int min_index_positive(Vector vector) {
int min_index_positive(Vector vector)
{
int i = 0;
while (i < vector.size() && vector[i] <= 0) {
while (i < vector.size() && vector[i] <= 0)
{
++i;
}
if (i >= vector.size()) {
if (i >= vector.size())
{
// No positive value found -> iterations stop
return -1;
}
int temp_index = i;
double temp = vector[i];
for (int j = i + 1; j < vector.size(); j++) {
if (vector[j] < temp && vector[j] > 0) {
for (int j = i + 1; j < vector.size(); j++)
{
if (vector[j] < temp && vector[j] > 0)
{
temp_index = j;
temp = vector[j];
}
@@ -41,11 +52,14 @@ int min_index_positive(Vector vector) {
return temp_index;
}
int min_index(Vector vector) {
int min_index(Vector vector)
{
int temp_index = 0;
double temp = vector[0];
for (int j = 0; j < vector.size(); j++) {
if (vector[j] < temp) {
for (int j = 0; j < vector.size(); j++)
{
if (vector[j] < temp)
{
temp_index = j;
temp = vector[j];
}
@@ -53,11 +67,14 @@ int min_index(Vector vector) {
return temp_index;
}
int max_index(Vector vector) {
int max_index(Vector vector)
{
int temp_index = 0;
double temp = vector[0];
for (int j = 0; j < vector.size(); j++) {
if (vector[j] > temp) {
for (int j = 0; j < vector.size(); j++)
{
if (vector[j] > temp)
{
temp_index = j;
temp = vector[j];
}
@@ -65,31 +82,40 @@ int max_index(Vector vector) {
return temp_index;
}
double min(std::vector<double> array) {
double min(std::vector<double> array)
{
double temp = array[0];
for (size_t i = 1; i < array.size(); i++) {
if (array[i] < temp) {
for (size_t i = 1; i < array.size(); i++)
{
if (array[i] < temp)
{
temp = array[i];
}
}
return temp;
}
double max(std::vector<double> array) {
double max(std::vector<double> array)
{
double temp = array[0];
for (size_t i = 1; i < array.size(); i++) {
if (array[i] > temp) {
for (size_t i = 1; i < array.size(); i++)
{
if (array[i] > temp)
{
temp = array[i];
}
}
return temp;
}
int min_index(std::vector<double> array) {
int min_index(std::vector<double> array)
{
int temp_index = 0;
double temp = array[0];
for (size_t i = 1; i < array.size(); i++) {
if (array[i] < temp) {
for (size_t i = 1; i < array.size(); i++)
{
if (array[i] < temp)
{
temp_index = i;
temp = array[i];
}
@@ -97,12 +123,14 @@ int min_index(std::vector<double> array) {
return temp_index;
}
int max_index(std::vector<double> array) {
int max_index(std::vector<double> array)
{
int temp_index = 0;
double temp = array[0];
for (size_t i = 1; i < array.size(); i++) {
if (array[i] > temp) {
for (size_t i = 1; i < array.size(); i++)
{
if (array[i] > temp)
{
temp_index = i;
temp = array[i];
}