THIS IS SELECTION SORTING GUYS..BUBBLE IS DIFFERENT -comparing each with adjacent element.This is different-after inner loop is executed once..the first element is the smallest. SO this is selection sorting

1. Psuedo code for insertion sorting INSERTION-SORT(a)for j = 2 to n key =A [j] // Insert A[j] into the sorted sequence A[1..j-1] j = i – 1 while i > 0 and A[i] > key A[i+1]= A[i] i = i – 1A[j+1]=key2. 2 . Psuedo code for linked listProcedure Create(Value)If there is enough memory available then Create New Node in memory Point its Next pointer to NULL If this is the first Node in the List thenPoint Start to the NodeOtherwise Go to memory location pointed by Start pointer Start Loop and run until Next points to Go to the Node pointed by Next pointer End LoopPoint Next of last Node to the newly created Node Put data in Value in new Node's Data EndifOtherwise Output error message that there is no more memory availableEndIfEnd Procedure Procedure Delete(Value) Pointer : Found Found = NULL If there are no Nodes in the List then Output error message that can't delete a Node Otherwise Go to memory location pointed by Start pointer Start Loop and run until Next points to NULL If value in Data of current Node is equal to Value then Found = current Node Exit Loop Endif Go to Node pointed by Next pointer of current Node End Loop If the required Node is the first Node in the List then Point the Start pointer to NULL OtherwisePoint Next of previous Node to the Node pointed by Next of Found EndifEndifEnd ProcedureProcedure DisplayIf Start points to NULL then Output error message that the List is emptyOtherwiseStart Loop at Start position and run until Next points to NULLOutput current Node's DataGo to Node pointed by Next pointer of current NodeEnd LoopEndifEnd Procedure3. Psuedo code for queue

Procedure Insert(Value)If End is equal to MAX then Output an error message that the Queue is fullOtherwiseAdd 1 to End 'Go to next available element in QueueStore data in Value into Queue at End positionEndifEnd ProcedureProcedure delete(Value)If End is equal to 0 then Output an error message that the Queue is emptyOtherwiseSUB 1 from End 'Go to previous available element in QueueRemove data in Value into Queue at End positionEndifEnd ProcedureProcedure DisplayIf End is equal to Zero then Output an error message that the Queue is emptyOtherwiseDisplay value at position Queue[1]Start Loop from position 1 to End position Copy data from Next element to Current element Move to Next elementEnd LoopEndIfEnd Procedure

i need a c program that accept values from user,arrange in ascending sorting oreder...condition is that when we enterd a number..the next number should be greater than first..like if we entered 20 than next will be greater..if smaller than program should stop..plz help me..

MP 5 – Take Home!Write a program that asks the user to type 10 integers of an array. The program must compute and write how many integers are greater than or equal to 10.Sample Input/Output:Enter number 1: 8Enter number 2: 11Enter number 3: 1Enter number 4: 12Enter number 5: 20Enter number 6: 5Enter number 7: 6Enter number 8: 9Enter number 9: 100Enter number 10: 21the number of integers greater or equal to 10 is 5.