AMA University Answers
Login
Register
AMA OED
Courses
ITE
ITE-6201
Algorithm that finds the locat...
Algorithm that finds the location of the smallest element in the unsorted portion of the list and moves it to the top of the unsorted portion of the list
Insertion Sort
Selection Sort
Correct
Merge Sort
Bubble Sort
Similar ITE-6201 questions
A linear list in which the last node points to the first node.
A linear list in which the pointer points only to the successive node.
Algorithms that use a list must know whether the list is array based or linked.
A list may be linear or nonlinear, depending on its implementation.
A leaf in a tree is a node with no children.
A simple sorting algorithm that works the way we sort playing cards in our hands.