Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- Console.Write("Input array: ");
- string[] str = Console.ReadLine().Split(" ");
- double[] nums = new double[0];
- foreach (string i in str)
- {
- Array.Resize(ref nums, nums.Length + 1);
- nums[nums.Length - 1] = Convert.ToDouble(i);
- }
- Console.Write("\nOutput:\nArray: ");
- foreach (double i in nums)
- {
- Console.Write($"{i} ");
- }
- double min_value = double.PositiveInfinity;
- double max_value = double.NegativeInfinity;
- foreach (double i in nums)
- {
- if (i < min_value)
- {
- min_value = i;
- }
- if (i > max_value)
- {
- max_value = i;
- }
- }
- Console.WriteLine($"\nMax num|index: {max_value} {Array.IndexOf(nums, max_value)}\nMin num|index: {min_value} {Array.IndexOf(nums, min_value)}");
- Console.Write("\nInput k [a or b]: ");
- string k = Console.ReadLine();
- Console.WriteLine("\nOutput:");
- if (k == "a")
- {
- Console.Write("Sorted array: ");
- double[] cur = new double[nums.Length - 1], prev = nums;
- double[] cur_min = new double[] { double.PositiveInfinity, 0 };
- int cnt = 0;
- while (cnt < nums.Length - 1)
- {
- for (int i = 0; i < prev.Length; i++)
- {
- if (prev[i] < cur_min[0])
- {
- cur_min[0] = prev[i];
- cur_min[1] = i;
- }
- }
- Console.Write($"{cur_min[0]} ");
- int cur_ind = 0;
- for (int n = 0; n < prev.Length; n++)
- {
- if (n != cur_min[1])
- {
- cur[cur_ind] = prev[n];
- cur_ind += 1;
- }
- }
- if (cur.Length == 1)
- {
- foreach (double i in cur)
- {
- Console.WriteLine($"{i}");
- break;
- }
- }
- prev = cur;
- cur = new double[prev.Length - 1];
- cnt++;
- cur_min[0] = double.PositiveInfinity;
- cur_ind = 0;
- }
- }
- if (k == "b")
- {
- Console.Write("Sorted array: ");
- Array.Sort<double>(nums);
- Array.Reverse(nums);
- foreach (double i in nums)
- {
- Console.Write($"{i} ");
- }
- }
- if (k != "a" & k != "b")
- {
- Console.WriteLine("Режим не выбран, заканчиваю работу..");
- }
- Console.WriteLine();
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement