Question

Need help to better understand this and how it works...

What do you consider to be the first and second priority in a sorting algorithm; and justify a key word or phrase to place in the string that is crucial. Provide a short pseudocode example in your discussion post to defend your thoughts. Explain your reasoning for selecting your first and second priorities.

Answer 1

Algorithm: It is a step by step process to solve a particular problem or Task.

Sorting: Arrange the elements either in ascending or descending order.

Priority: Very Important. It will look like as some VIP person/Urgent/Emergency.

Sorting can be classified as two types.

1. Internal Sorting- Bubble sort, Insertion sort, Quick sort1

2. External sorting- Radix/Bucket sort, Merge sort

One of the operation in data structure which plays a role in processing of data is “Sorting” which organizes the records in some logical order, i.e. either in ascending order or in descending order.The main advantage of sorting application is that it requires less time to search for a particular element compared to unsorted list of elements.

We have to perform many attempts made to analyze and reduce the complexity of various algorithm. Also improved sorting algorithms have been proposed to get better efficiency in terms of time and memory. The performance of each sorting algorithm is based on the data being sorted and the machine used for sorting.

The sorting algorithm performs two operations: 1. Compare 2. Swap

The sorting of elements can be done on the basis of priority which we want to display the element first and then remaining list of elements. But the problem arises here is that they are displaying all the records on the basis of priorities, which consumes same amount of time. We are proposing an algorithm which will display required records only as per user’s choice on the basis of priorities and attributes. So, that we can save time.

Advantages:

- Apply priority based sorting on multiple attributes of records.

- Save time on the basis of number of operations.

Algorithm:

1. Insert the List of Elements which you want to sort and assign the priority to each element.

2. Sort the elements on the basis of the Elements order

3. Displays the sorted list of elements.

4. Exit

Pseudo Code:

Input: a collection S storing n elements

Output: the collection S

sorted P = new PQueue()

while !S.isEmpty()

do e = S.removeFirst()

P.insert(e)

while !P.isEmpty()

e = P.removeMin()

S.addLast(e)

INSERTION-SORT(A)

for j ←2 to length[A]

do

key ← A[j]

Insert A[j] into the sorted sequence

A[1 j- 1]. i ← j- 1

while i> 0 and A[i] > key

do

A[i+ 1] ← A[i]

i ← i- 1

A[i+ 1] ← key

The Best example to use this type is Priority Queue with the help of Insertion sort.