HomeProjectsArticlesNotesAbout

Algorithms

algorithms
notes

Algorithms

Courses

Leaning C# Algorithms

Lynda log 4/14/2018

Overview

Algorithm uses

  • compressing data
  • sorting
  • generating random numbers

Start: 4/14/2018, 11:00:00 AM

Common Algorithms

Linked List

Collection of items, in nodes which points to the next element in the list. Benefit

  • insert data at any point
  • can increase of decrease the size with relative efficiency.

Key Terms head: beginning of a linked list tail: end of a linked list NULL: last node

Class definition of node

Singly linked list A singly linked list does not contain a pointer to the previous node in the list. //Note: examine further:drill:train

Stack

The stack is an abstract data type that serves as a collection of elements Key Terms push: add an element pop: remove element ~ Stack is a LIFO(last in fist out) structure

Note: elements are not actually removed or added to the array. Rather pointers End: 4/14/2018, 1:10:10 PM

To learn

Catch

RESOURCES

REFERENCES

Lynda: Learning C# Algorithms

List of common sorting algorithms |name|acquainted|practiced|compotnet | proficient| expert| |:----:|:----:|:----:|:----:|:----:|:----:|:----:|:----:| | Bubble sort|X||||| | Heapsort|X||||| | Quicksort|||||| | Insertion sort|||||| | Selection sort |||||| | Merge sort |||||| | Pancake sort |||||| | Permutation sort |||||| | Cocktail sort|||||| | Comb sort |||||| | Counting sort |||||| | Gnome sort |||||| | Bead sort |||||| | Radix sort |||||| | Shell sort |||||| | Sleep sort |||||| | Strand sort ||||||

DEFINITIONS

More Articles

All Articles

Links

Home Articles Notes Projects About Style Guide Site Credits

Contact

ย connect@dev.lucaszapico.space

Location

๐ŸŒŽ Earth