Question

Implement in C SharpCreate a new algorithm based on the algorithm, selection sort. The new algorithm should be able to sort an array like this: Input: an array that has n elements, and the values of its elements are assigned randomly, for example: Index 0 1 2 3 4 5 value 7 3 6 2 1 5 Output: an array - its first n/2 elements are sorted in ascending order and its second n/2 elements sorted in descending order. That is, after sorting, the array above will become: Index 0 1 2 3 4 5 value 5 6 7 3 2 1 As the solution of this problem, you need to submit the following answer(s): (1). Your algorithm written in pseudo code . (2). The implementation of your algorithm in C# .

Answer 1

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;
namespace wk5collabproject
{
class Program
{
static void Main(string[] args)
{

//int [] myArray = new int[] { 5,2,4, 7, 9, 3, 1, 6, 8 };
int [] myArray = new int[] { 5,2,3,4,5,6,7,8 };
int middle, temp , curr;
if(myArray.Length%2==0)
middle = myArray.Length/2;
else
middle = (myArray.Length+1)/2;

for(int i=0; i<myArray.Length; ++i){
if(i<middle){
curr = i;
for(int j=i+1; j<middle;++j){

if(myArray[curr] > myArray[j]){
temp = myArray[curr];
myArray[curr]=myArray[j];
myArray[j] = temp;
}

}
}
else {
curr = i;
for(int k=i+1; k<myArray.Length; ++k){
if(myArray[curr]<myArray[k]){
curr = k;
}
temp = myArray[i];
myArray[i]=myArray[curr];
myArray[curr]= temp;
}
}
}
for(int i=0;i<myArray.Length;++i){
Console.WriteLine(myArray[i] + " ");
}
}
}
}

================================================================
See Ouput


class Program 2 3 static void Main(string[] args) Ant myArray - new int 5,2,4, 7, 9, 3, 1, 6, 8; 5,2,3,4,5,6,7,8 ; 6 int myArray -new int int middle, temp, curr; if(myArray. Length%2--0) middle myArray.Length/2; middle CmyArray.Length+1)/2; if(i middle)t else for(int 1-0; 1<myArray . Length; ++i){ curr i for(int j-i+1; j<middle;++j) if(myArray[curr]> myArray[j]) temp myArray[curr]; myArray [curr]-myArray[j]; myArray[j] temp;


Thanks

Answer 2

using System;

using System.Collections.Generic;

using System.Linq;

using System.Text;

namespace Selection_Sort

{

    class Program

    {

        static void Main(string[] args)

        {

            Selection_Sort selection = new Selection_Sort(10);

            selection.Sort();

        }

    }

    class Selection_Sort

    {

        private int[] data;

        private static Random generator = new Random();

        //Create an array of 10 random numbers

           public Selection_Sort(int size)

        {

            data = new int[size];

            for (int i = 0; i < size; i++)

            {

                data[i] = generator.Next(20, 90);

            }

        }

        public void Sort()

        {

            Console.Write("\nSorted Array Elements :(Step by Step)\n\n");

display_array_elements();

int smallest; 

            for (int i = 0; i < data.Length - 1; i++)

            {

                smallest = i;

                for (int index = i + 1; index < data.Length; index++)

                {

                    if (data[index] < data[smallest])

                    {

                        smallest = index;

                    }

                }

                Swap(i, smallest);

                display_array_elements();

   }

           

        }

        public void Swap(int first, int second)

        {

            int temporary = data[first];    

            data[first] = data[second];  

            data[second] = temporary;  

        }  

        public void display_array_elements()

        {        

            foreach (var element in data)

            {

                Console.Write(element + " ");

            }

            Console.Write("\n\n");

        }

    }

}