Algorithms: Difference between revisions
No edit summary |
No edit summary |
||
| Line 18: | Line 18: | ||
Sample Output : [ 0, 2, 3, 4, 5, 7, 8, 9 ] | Sample Output : [ 0, 2, 3, 4, 5, 7, 8, 9 ] | ||
'''Python Code''' | '''Example Python Code''' | ||
---- | ---- | ||
{| | |||
def insertionSort(alist): | def insertionSort(alist): | ||
:for index in range(1,len(alist)): | :for index in range(1,len(alist)): | ||
| Line 32: | Line 34: | ||
insertionSort(alist) | insertionSort(alist) | ||
print(alist) | print(alist) | ||
|} | |||
=== Which Algorithms Are Best Suited for Which Tasks === | === Which Algorithms Are Best Suited for Which Tasks === | ||
Revision as of 11:40, 13 December 2016
Algorithms are a type of technology used in multiple fields of study that dictate or alter streams of information (in this case we will most be referring to computer science). The code/pseuocode presented on here will be written in Python.
Case Uses For Implementing Algorithms (Engineering and Computer Science) :
Common Computer Science Algorithms
Algorithms used in Computer Science are developed and implemented to alter the way data moves in network somehow ( the network representing the collection of data used to create a program/system )
The most common present:
Insertion Sort (sorting algorithm for small number of elements): This Algorithm rearranges a disordered list of integers and rearranges them in natural order. This algorithm is typically used for small array of elements.
Sample Input : [ 8, 3, 9, 0, 2, 7, 4, 5 ] Sample Output : [ 0, 2, 3, 4, 5, 7, 8, 9 ]
Example Python Code
def insertionSort(alist): :for index in range(1,len(alist)): : :currentvalue = alist[index] : :position = index : :while position>0 and alist[position-1]>currentvalue: : : :alist[position]=alist[position-1] : : :position = position-1 : :alist[position]=currentvalue alist = [54,26,93,17,77,31,44,55,20] insertionSort(alist) print(alist)
