Skip to content

Коньшина, БИВТ 25-11, белая, 4 лаба #267

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Closed
sofiakonshina1-arch wants to merge 2 commits into from
Closed

Коньшина, БИВТ 25-11, белая, 4 лаба #267

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
9a4b8f1
Коньшина, 4 лаба, белая, БИВТ 25-11
sofiakonshina1-arch Oct 31, 2025
180d88d
Коньшина, БИВТ 25-11, белая, 4 лаба
sofiakonshina1-arch Nov 5, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
267 changes: 261 additions & 6 deletions Lab4/White.cs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,4 +1,6 @@
namespace Lab4
using System.Runtime.ExceptionServices;

namespace Lab4
{
public class White
{
Expand All @@ -7,7 +9,12 @@ public double Task1(int[] vector)
double length = 0;

// code here

if (vector == null || vector.Length == 0)
return 0;
double sumSquares = 0;
for (int i = 0; i < vector.Length; i++)
sumSquares += vector[i] * vector[i];
length = Math.Sqrt(sumSquares);
// end

return length;
Expand All @@ -17,7 +24,15 @@ public int Task2(int[] array, int P, int Q)
int count = 0;

// code here

if (array == null || array.Length == 0)
return 0;
int minValue = Math.Min(P, Q);
int maxValue = Math.Max(P, Q);
for (int i = 0; i < array.Length; i++)
{
if (array[i] > minValue && array[i] < maxValue) \
count++;
}
// end

return count;
Expand All @@ -26,15 +41,73 @@ public void Task3(int[] array)
{

// code here

if (array == null || array.Length == 0)
return;


int maxIndex = 0;
for (int i = 1; i < array.Length; i++)
{
if (array[i] > array[maxIndex])
{
maxIndex = i;
}
}


if (maxIndex == array.Length - 1)
return;


int minAfter = maxIndex + 1;
for (int i = maxIndex + 2; i < array.Length; i++)
{
if (array[i] < array[minAfter])
{
minAfter = i;
}
}


bool allEqual = true;
for (int i = maxIndex + 1; i < array.Length; i++)
{
if (array[i] != array[minAfter])
{
allEqual = false;
break;
}
}


if (!allEqual)
{
int temp = array[maxIndex];
array[maxIndex] = array[minAfter];
array[minAfter] = temp;
}
// end

}
public void Task4(int[] array)
{

// code here
if (array == null || array.Length == 0)
return;


int maxIndex = 0;
for (int i = 2; i < array.Length; i += 2)
{
if (array[i] > array[maxIndex])
{
maxIndex = i;
}
}


array[maxIndex] = maxIndex;
// end

}
Expand All @@ -43,7 +116,21 @@ public int Task5(int[] array, int P)
int index = 0;

// code here
index = -1;


if (array == null)
return index;


for (int i = 0; i < array.Length; i++)
{
if (array[i] == P)
{
index = i;
break;
}
}
// end

return index;
Expand All @@ -52,7 +139,26 @@ public void Task6(int[] array)
{

// code here

if (array == null || array.Length == 0)
return;


int maxIndex = 0;
for (int i = 1; i < array.Length; i++)
{
if (array[i] > array[maxIndex])
{
maxIndex = i;
}
}


for (int i = 0; i < maxIndex - 1; i += 2)
{
int temp = array[i];
array[i] = array[i + 1];
array[i + 1] = temp;
}
// end

}
Expand All @@ -61,7 +167,30 @@ public int[] Task7(int[] array)
int[] answer = null;

// code here
if (array == null)
return answer;


int count = 0;
for (int i = 0; i < array.Length; i++)
{
if (array[i] >= 0)
{
count++;
}
}


answer = new int[count];
int index = 0;
for (int i = 0; i < array.Length; i++)
{
if (array[i] >= 0)
{
answer[index] = array[i];
index++;
}
}
// end

return answer;
Expand All @@ -70,15 +199,39 @@ public void Task8(int[] array)
{

// code here

if (array == null || array.Length == 0)
return;


for (int i = 0; i < array.Length - 1; i++)
{
for (int j = 0; j < array.Length - 1 - i; j++)
{
if (array[j] < array[j + 1])
{
int temp = array[j];
array[j] = array[j + 1];
array[j + 1] = temp;
}
}
}
// end

}
public void Task9(int[] array)
{

// code here
if (array == null || array.Length == 0)
return;


for (int i = 0; i < array.Length / 2; i++)
{
int temp = array[i];
array[i] = array[array.Length - 1 - i];
array[array.Length - 1 - i] = temp;
}
// end

}
Expand All @@ -87,7 +240,62 @@ public int[] Task10(int[] A, int[] B)
int[] C = null;

// code here
if (A == null && B == null)
{
C = new int[0];
return C;
}


if (A == null || A.Length == 0)
{
C = (int[])B.Clone();
return C;
}


if (B == null || B.Length == 0)
{
C = (int[])A.Clone();
return C;
}


C = new int[A.Length + B.Length];


int indexA = 0;
int indexB = 0;
int indexC = 0;


while (indexA < A.Length && indexB < B.Length)
{
C[indexC] = A[indexA];
indexC++;
indexA++;


C[indexC] = B[indexB];
indexC++;
indexB++;
}


while (indexA < A.Length)
{
C[indexC] = A[indexA];
indexC++;
indexA++;
}


while (indexB < B.Length)
{
C[indexC] = B[indexB];
indexC++;
indexB++;
}
// end

return C;
Expand All @@ -97,7 +305,30 @@ public double[] Task11(double a, double b, int n)
double[] array = null;

// code here
if (n <= 0) return null;


if (Math.Abs(a - b) < double.Epsilon)
{
if (n == 1)
array = new double[] { a };
else
return null;
}
else
{


if (n < 2) return null;


array = new double[n];
double step = (b - a) / (n - 1);


for (int i = 0; i < n; i++)
array[i] = a + step * i;
}
// end

return array;
Expand All @@ -108,7 +339,31 @@ public double[] Task12(double[] raw)
double[] restored = null;

// code here
if (raw == null || raw.Length < 3)
return null;


restored = (double[])raw.Clone();


for (int i = 0; i < restored.Length; i++)
{
if (restored[i] == -1)
{
int prevIndex = i == 0 ? restored.Length - 1 : i - 1;
int nextIndex = i == restored.Length - 1 ? 0 : i + 1;


double prevValue = restored[prevIndex];
double nextValue = restored[nextIndex];


if (prevValue != -1 && nextValue != -1)
{
restored[i] = (prevValue + nextValue) / 2.0;
}
}
}
// end

return restored;
Expand Down
Loading