New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Quick Refeference Guide: Typical primitive algorithm steps #110

Open

gstark opened this issue Oct 19, 2020 · 1 comment

Labels

good first issue Quick Reference Guide

Contributor

gstark commented Oct 19, 2020

This one is a bit tricky, but here is how I think it can go:

Review all the codewars we tend to assign students during a cohort
Break each one down into a technique used to solve it. e.g.:

Splitting a string
Filtering an array
Mapping an array
Summing data
Conditional ("if")
Switch statements
Even vs odd
etc.

Then for each of those write that as an algorithm step and a brief statement about:
a. How to determine an algorithm might need that approach
b. How to implement it in an algorithm (give an example)

gstark added Quick Reference Guide good first issue labels

gstark added a commit that referenced this issue


          Adds template for primitive algorithm steps

f1eb915

References #110

Contributor Author

gstark commented Feb 3, 2021

You can use the github editor here: https://github.com/suncoast-devs/handbook/edit/master/lessons/misc-quick-reference/primitive-algorithm-steps.md

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment