An International Communication Network company gets blocks of 1024data/parameter

Question

An International Communication Network company gets blocks of 1024data/parameter entries. One item in a 1024 block consists of thedata/parameter code, time stamp, and parameter value. A new 1024block arrives every 5-7 seconds. When a block of data arrives,items are not necessarily in any particular order. The data aresimply grouped into blocks of 1024 as they arrive from varionsnetwork objects.

So the question is what is the most appropriate sorting algorithmto use if the data are to be ordered by time? Which one would bemore efficient to use: quicksort, insertsort, or selectionsort? Ithas to be sorted with respect to time. Also, we are allowed tochange what type of sorting algorithms to use, for an example, ifit would be more efficient to use quicksort for the first box, thenthat might not be the case later on. Please help me decide whichsorting algorithm would be more efficient in respect to time.Thanks a lot

Explanation / Answer

       i would suggest quicksort for sorting entire array. This can be used in the begining.But over time, i would suggest you to use Insertion sort orselection sort.       There is research conducted byInternationnal Baccalaureate Extended, Accroding this research,quick sort is more efficient than any other algorithms,as the datasize grows.But this will be operated on entire set of data.In yourcase, over time,we will be ending up in adding/inserting the new incoming records in to the sorted list.So inthis case i would prefer selection sort orInsertion sort.       InsertionSort is a "natural"sorting algorithm. In the simplest form it works with an input listand an already sorted list. If the sorted list is empty, the firstrecord of the input list is moved to the sorted list. Then recordafter record is taken and its appropriate position in the sortedlist is searched; all records behind this position are moved up byone position and the record is inserted, hence the name.       SelectionSort divides a listinto a sorted part and the unsorted part. At the beginningeverything belongs to the unsorted part. Then the element with thesmallest key value is looked up and swaped with the first elementof the list. The sorted part now starts and ends with element 1 andthe unsorted part starts with element 2. In the second run thesmallest element is looked up starting from position 2. When thesmallest element is determined it swaps with the element onposition two

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.