Algorithms - Revision history

Brodriguez: Remove pseudocode definition

2019-09-08T21:58:24Z

Remove pseudocode definition

← Older revision		Revision as of 21:58, 8 September 2019
Line 10:		Line 10:
	*** The algorithm does not halt.		*** The algorithm does not halt.
	*** The algorithm halts/ends, but provides incorrect output.		*** The algorithm halts/ends, but provides incorrect output.
	* '''Pseudo Code''' - Code written in whatever expressive method is most clear and concise.
	** Generally, pseudo code meant for human reading rather than machine reading, and thus does not worry about "issues of software engineering", such as error checking, abstraction, modularity, etc.
	* '''Data Structure''' - A way to store and organize data in order to facilitate access and modification.		* '''Data Structure''' - A way to store and organize data in order to facilitate access and modification.
	* '''Running time''' - The number of "Primitive Operations" a piece of code needs to execute to finish running.		* '''Running time''' - The number of "Primitive Operations" a piece of code needs to execute to finish running.

Brodriguez: Add link

2019-09-08T20:13:21Z

Add link

← Older revision		Revision as of 20:13, 8 September 2019
Line 16:		Line 16:

	== Algorithms Topics ==		== Algorithms Topics ==
			* [[Algorithms - Pseudocode\|Pseudocode]]
	* [[Algorithms - Primitive Operations\|Primitive Operations]]		* [[Algorithms - Primitive Operations\|Primitive Operations]]
	* [[Algorithms - Runtime Analysis\|Runtime Analysis]]		* [[Algorithms - Runtime Analysis\|Runtime Analysis]]

Brodriguez: Update wording

2019-09-08T16:16:53Z

Update wording

← Older revision		Revision as of 16:16, 8 September 2019
Line 3:		Line 3:
	More often than not, we only care about the the computational time (speed) of the algorithm. However, depending on data size and hardware limitations, memory, communication, or other space-related resources are the focus as well. To be more precise, we can define a few key terms:		More often than not, we only care about the the computational time (speed) of the algorithm. However, depending on data size and hardware limitations, memory, communication, or other space-related resources are the focus as well. To be more precise, we can define a few key terms:

	* '''Algorithm''' - Any well-~~defined computational~~ procedure ~~that~~ takes some value as input and produces some value as output.		* '''Algorithm''' - Any well defined, step-by-step procedure for performing some task in a finite amount of time.
			** Generally takes some value as input and produces some value as output.
	* '''Algorithm Correctness''':		* '''Algorithm Correctness''':
	** An algorithm is "correct" if, for every input instance, the algorithm halts/ends with the correct output.		** An algorithm is "correct" if, for every input instance, the algorithm halts/ends with the correct output.

Brodriguez: formatting

2019-09-08T15:00:44Z

formatting

← Older revision		Revision as of 15:00, 8 September 2019
Line 3:		Line 3:
	More often than not, we only care about the the computational time (speed) of the algorithm. However, depending on data size and hardware limitations, memory, communication, or other space-related resources are the focus as well. To be more precise, we can define a few key terms:		More often than not, we only care about the the computational time (speed) of the algorithm. However, depending on data size and hardware limitations, memory, communication, or other space-related resources are the focus as well. To be more precise, we can define a few key terms:

	* Algorithm - Any well-defined computational procedure that takes some value as input and produces some value as output.		* '''Algorithm''' - Any well-defined computational procedure that takes some value as input and produces some value as output.
	* Algorithm Correctness:		* '''Algorithm Correctness''':
	** An algorithm is "correct" if, for every input instance, the algorithm halts/ends with the correct output.		** An algorithm is "correct" if, for every input instance, the algorithm halts/ends with the correct output.
	** An algorithm is "incorrect" if for some input instances:		** An algorithm is "incorrect" if for some input instances:
	*** The algorithm does not halt.		*** The algorithm does not halt.
	*** The algorithm halts/ends, but provides incorrect output.		*** The algorithm halts/ends, but provides incorrect output.
	* Pseudo Code - Code written in whatever expressive method is most clear and concise. Generally meant for human reading rather than machine reading, and thus does not worry about "issues of software engineering", such as error checking, abstraction, modularity, etc.		* '''Pseudo Code''' - Code written in whatever expressive method is most clear and concise.
	* Data Structure - A way to store and organize data in order to facilitate access and modification.		** Generally, pseudo code meant for human reading rather than machine reading, and thus does not worry about "issues of software engineering", such as error checking, abstraction, modularity, etc.
	* Running time - The number of "Primitive Operations" a piece of code needs to execute to finish running.		* '''Data Structure''' - A way to store and organize data in order to facilitate access and modification.
			* '''Running time''' - The number of "Primitive Operations" a piece of code needs to execute to finish running.

	== Algorithms Topics ==		== Algorithms Topics ==
	* [[Algorithms - Primitive Operations\|Primitive Operations]]		* [[Algorithms - Primitive Operations\|Primitive Operations]]
	* [[Algorithms - Runtime Analysis\|Runtime Analysis]]		* [[Algorithms - Runtime Analysis\|Runtime Analysis]]

Brodriguez: Create page

2019-09-08T14:59:54Z

Create page

New page

For the most part, the theory and study of Algorithms deals with runtime and size complexity. That is "how fast does this code run, and/or how much space does it take up while running?"

More often than not, we only care about the the computational time (speed) of the algorithm. However, depending on data size and hardware limitations, memory, communication, or other space-related resources are the focus as well. To be more precise, we can define a few key terms:

* Algorithm - Any well-defined computational procedure that takes some value as input and produces some value as output.
* Algorithm Correctness:
** An algorithm is "correct" if, for every input instance, the algorithm halts/ends with the correct output.
** An algorithm is "incorrect" if for some input instances:
*** The algorithm does not halt.
*** The algorithm halts/ends, but provides incorrect output.
* Pseudo Code - Code written in whatever expressive method is most clear and concise. Generally meant for human reading rather than machine reading, and thus does not worry about "issues of software engineering", such as error checking, abstraction, modularity, etc.
* Data Structure - A way to store and organize data in order to facilitate access and modification.
* Running time - The number of "Primitive Operations" a piece of code needs to execute to finish running.

== Algorithms Topics ==
* [[Algorithms - Primitive Operations|Primitive Operations]]
* [[Algorithms - Runtime Analysis|Runtime Analysis]]