Difference between revisions of "Software"
From Wiki2
(2 intermediate revisions by the same user not shown) | |||
Line 1: | Line 1: | ||
{{:bugs and mistakes}} | |||
{{:functional programming}} | |||
==software engineering concepts and software design patterns== | ==software engineering concepts and software design patterns== | ||
*[http://en.wikipedia.org/wiki/CakePHP links to] well-known software engineering concepts and software design patterns, as Convention over configuration, Model-View-Controller, ActiveRecord, Association Data Mapping, and Front Controller. | *[http://en.wikipedia.org/wiki/CakePHP links to] well-known software engineering concepts and software design patterns, as Convention over configuration, Model-View-Controller, ActiveRecord, Association Data Mapping, and Front Controller. | ||
Line 16: | Line 20: | ||
*priority queue, | *priority queue, | ||
*binary search tree | *binary search tree | ||
==algorithm tutorials== | |||
*[http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=alg_index top coder] |
Latest revision as of 10:53, 2 December 2016
bugs and mistakes I always make
for sorting
const conres = { variety: 'Glacier', dot: 'yellow', num: 0 }, { variety: 'Supersweet 100', dot: 'blue', num: 0 }, { variety: 'Brandywine', dot: 'red', num: '5' }, { variety: 'Purple Cherokee', dot: 'purple', num: '7' }, { variety: 'Moskovich', dot: 'green', num: '4' }, { variety: 'Valencia', dot: 'orange', num: '4' }, { variety: 'Striped German', dot: 'pink', num: '4' }, { variety: 'Glacier', dot: 'yellow', num: '4' }, { variety: 'Supersweet 100', dot: 'blue', num: '4' }, const sorres =conres.sort((a,b)=>a.variety < b.variety ? -1 :1) NOT
const sorres =conres.sort((a,b)=>a.variety < b.variety)
software engineering concepts and software design patterns
- links to well-known software engineering concepts and software design patterns, as Convention over configuration, Model-View-Controller, ActiveRecord, Association Data Mapping, and Front Controller.
big O complexity
basic routines that I should know
You should implement the most common data structures in your language of choice. Do not rely on common libraries. Implement the following and write tests for them:
- vector (dynamic array),
- linked list,
- stack,
- queue,
- circular queue,
- hash map,
- set,
- priority queue,
- binary search tree