Aurea Aurea-Li

## Ada-Notes.md

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                Aurea-Li
                / Ada-Notes.md
            
            
              Last active
              November 5, 2018 17:10
            
              
                Ada Notes
              
          
    Gems

Convention to put them on separate lines in alphabetical order.
Git

HEAD can be used instead of <hash> to specify the most recent commit.
git branch: list of git branches
git checkout <hash>: pull up snapshot of repository at certain commit

git checkout -b : create a new branch

  
## template.html
<!DOCTYPE html>
<html lang="en" dir="ltr">
  <head>
    <meta charset="utf-8">
    <title></title>

   <script src="https://code.jquery.com/jquery-3.3.1.js"></script>
   <script src="https://unpkg.com/axios/dist/axios.min.js"></script>
   <script type="text/javascript" src="index.js"></script>


## normalize.css
/*! normalize.css v8.0.0 | MIT License | github.com/necolas/normalize.css */

/* Document
   ========================================================================== */

/**
 * 1. Correct the line height in all browsers.
 * 2. Prevent adjustments of font size after orientation changes in iOS.
 */

## index.html
<!DOCTYPE html>
<html lang="en" dir="ltr">
  <head>
    <meta charset="utf-8">
    <title>Seven Wonders</title>

    <script
  src="https://code.jquery.com/jquery-3.3.1.js"></script>
  <script src="https://unpkg.com/axios/dist/axios.min.js"></script>
  <script type="text/javascript" src="index.js"></script>

## minimum_waste.py
# What is time and space complexity of algorithm?
# Unsure how to only keep track of one integer value instead of saving an array of minimum waste values.
def minimum_waste(bottles, potion):
    # sort from greatest to least
    bottles.sort(reverse = True)
    w = []

    recurse_minimum_waste(w, bottles, potion, bottles[0])
    return min(w)
	<!DOCTYPE html>
	<html lang="en" dir="ltr">
	<head>
	<meta charset="utf-8">
	<title></title>

	<script src="https://code.jquery.com/jquery-3.3.1.js"></script>
	<script src="https://unpkg.com/axios/dist/axios.min.js"></script>
	<script type="text/javascript" src="index.js"></script>
	/! normalize.css v8.0.0 \| MIT License \| github.com/necolas/normalize.css /

	/* Document
	========================================================================== */

	/**
	* 1. Correct the line height in all browsers.
	* 2. Prevent adjustments of font size after orientation changes in iOS.
	*/
	# What is time and space complexity of algorithm?
	# Unsure how to only keep track of one integer value instead of saving an array of minimum waste values.
	def minimum_waste(bottles, potion):
	# sort from greatest to least
	bottles.sort(reverse = True)
	w = []

	recurse_minimum_waste(w, bottles, potion, bottles[0])
	return min(w)