SIT 221 Classes, Libraries and Algorithms | Import and explore the attached ISorter.cs file. It cont

downloaded from

Scholarfriends

https://scholarfriends.com Downloaded by: writerforacademic@gmail.com | https://scholarfriends.com/singlePaper/314011/import-and-explore-the-attached-isortercsfile-it-contains-the-isorter-interface-which-consists-o Distribution of this document is illegal.

Hi, please modify the given code in accordance to the given instructions. Please provide step-bystep explanation as well to your code solution. Many thanks :)

Image transcription text Import and explore the attached ISorter.cs file. It contains the ISorter interface, which consists of only a single generic method with the following signature and purpose: void Sort<K>( K[ ] array, int index, int num, IComparer<K> comparer ) Sorts the data elements stored in the specified one-dimensional array in the range defined by the starting position index and the number of subsequent elements num. The order of sorted elements is determined by the specified comparer, or, if the comparer is null, by the default comparer for type K obtained through the Comparer<K>.Default property. This method must throw the following exceptions: ArgumentNullException if the array is null, . ArgumentOutOfRangeException if the given index or num or both are negative, . ArgumentException if the values of index and num do not specify a valid range within the given array. In order to make the type K compatible with the Sort method, there is a constraint applied to this generic type that expects the implementation of the IComparable<K> interface. That is, any concrete type to replace the placeholder K during the runtime must implement the IComparable<K> and its mandatory CompareTo(K another) method. This requirement ensures that the call to the Comparer<K>.Default property is possible in case when the specified comparer equals null. Extend your Vector<T> class by adding the following method: - void Sort( ISorter algorithm, IComparer<T> comparer ) Sorts the elements in the entire Vector<T> collection using the specified sorting algorithm and comparer. If the algorithm is null, the sorting operation should be delegated to the Array.Sort as the default sorting method. If the comparer is

null, the order of sorted elements is determined by the default comparer for type T; that is, by Comparer<T>.Default.

// ISorter.cs using System; using System.Collections.Generic; using System.Linq; using System.Text; using System.Threading.Tasks; namespace Vector { public interface ISorter { void Sort<K>(K[] array, int index, int num, IComparer<K> comparer) where K : IComparable<K>; } }

// Vector.cs using System; using System.Collections.Generic; using System.Text; namespace Vector { public class Vector<T> { // Void Sort() method here } }

Computer ScienceEngineering & TechnologyObject-Oriented ProgrammingSIT 221 Share Question

Answer & Explanation Solved by verified expert In this work, we were required to change the provided code in order to add a Sort() method utilising the ISorter interface to the Vector<T> class. The Sort() method should use the supplied sorting algorithm and comparer to order every element in the vector. The default sorting algorithm, Array.Sort(), should be applied if the algorithm parameter is null. The default comparer for type T, Comparer<T>, is used if the comparer is null. Use default instead.

The Sort() method was added to the Vector<T> type to implement this. Before calling Array, the function determines whether the ISorter algorithm is null. With the elements and a comparer if necessary, sort(). Instead, it sorts the elements using the provided algorithm's Sort() method using the supplied comparer. In order to store and retrieve the vector's elements, we also added the necessary fields, properties, and methods to the Vector<T> class.

I hope that helps. Thankyou!!

Step-by-step explanation Step 1: We can use the ISorter interface that has been provided to us in order to implement the Sort() method in the Vector<T> class. The Sort() method should use the supplied sorting algorithm and comparer to order every element in the vector. The default sorting algorithm, Array.Sort(), should be used if the algorithm parameter is null. The default comparer for type T, Comparer<T>, is used if the comparer is null. Use default instead.

Step 2: Updated Code - ISorter.cs using System; namespace Vector { public interface ISorter { void Sort<K>(K[] array, int index, int num, IComparer<K> comparer) where K : IComparable<K>; } }

Updated Code - Vector.cs using System; using System.Collections.Generic; using System.Text; namespace Vector

{ public class Vector<T> { private T[] elements; private int count; public Vector(int initialCapacity) { elements = new T[initialCapacity]; count = 0; } public void Add(T item) { if (count == elements.Length) { Array.Resize(ref elements, count * 2); } elements[count++] = item; } public T this[int index] { get { if (index < 0 || index >= count) { throw new IndexOutOfRangeException(); } return elements[index]; } set { if (index < 0 || index >= count) { throw new IndexOutOfRangeException(); } elements[index] = value; } } public int Count { get { return count; } } public void Sort(ISorter algorithm, IComparer<T> comparer) { if (algorithm == null) { Array.Sort(elements, 0, count, comparer);

} else { algorithm.Sort(elements, 0, count, comparer); } } } }

Step 3:

In order to store the elements of the vector and keep track of their quantity, we added the private fields elements and count.

To add an element to the vector, we implemented an Add() method. If the internal array of the vector is full, we use Array to double its size. Resize().

To access elements by index, we implemented an indexer. We throw an IndexOutOfRangeException if the index is out of bounds.

To determine how many items are in the vector, we created a Count property.

We added the Sort() method, which accepts an IComparer<T> comparer and an ISorter algorithm. The elements of the vector are sorted using Array.Sort() with the provided comparer if the algorithm is null. Instead, we sort the elements of the vector using the provided comparer and the Sort() method of the defined algorithm.

Keep in mind that since System.Linq wasn't being utilised, we didn't add a using directive for it in the ISorter.cs code.