1. Git - Version Control with GitHub and Git

 Controlling file versions and projects.


Committing Process:

Modifying (modify files) -> Staging (picking which modified file to commit) -> Committing

- push to make changes from local to server

- pull to make changes from server to local


How to start:

In terminal:

- git init // initializes a git folder

- git status // shows the status of project

- git add <filename> // adds a file to the staging process

    - git add . // stages all modified files

- git commit -m "STRING MESSAGE"

- git checkout -- <filename> // retrieve file from git repo


- git remote add origin <githubRepoLink> // link origin branch to the github repo

    - need setup before using "git push" shortcut

    - git push --set-upstream origin master

- git push origin master // pushes the origin(localname) to the master branch in github


Pulling:

- git pull origin master // pulls the master branch


Branches:

- master branch // the main branch that contains original code and their evolution.

- git checkout -b NEWBRANCHNAME // creates a new branch from the master branch

- git branch // shows branches

- git push origin NEWBRANCHNAME // pushes the new branch onto github.

- can merge branches to master using pull requests.


Others:

- git log // shows all commit logs and hash checkpoints.

- git checkout [hash] // restore chosen commit and branch off from master branch.

Comments

Post a Comment

Popular posts from this blog

2. FreeCodeCamp - Dynamic Programming - Learn to Solve Algorithmic Problems & Coding Challenges

Dynamic Programming - Parts      PART 1 - Memoization     P ART 2 - Tabulation Dynamic Programming with Fibonacci Example Recursion: Slow because time complexity is O(2^n) func fibR (x int ) int {     if x <= 2 {         return 1     }     return fibR (x- 1 ) + fibR (x- 2 ) } Dynamic Way Example Recursion with Stored Value:  // Fast because it removes duplicate processes by checking map. // Tail recursion-ish // Results are hitchhiking each recursive call func fibR2 (x int , y map [ int ] int ) int {     if _ , ok := y[x]; ok {         return y[x]     }     if x <= 2 {         return 1     }     y[x] = fibR2 (x- 1 , y) + fibR2 (x- 2 , y)     return y[x] }
Read more

20. Data Analytics - Analyze Data to Answer Questions - Week 1

Goal of analysis is to identify trends and relationships within data so you can accurately answer the questions you're asking. Most data is organized in tables, always have data in the right format. Definition : Analysis // process used to make sense of the data collected Sorting // involves arranging data into a meaningful order to make it easier to understand, analyze, visualize Outliers // data points that are very different from similarly collected data and might not be reliable values Filtering // extracting specific data that meet certain criteria while hiding the rest Customized sort order // when you sort data in a spreadsheet using multiple conditions The 4 phases of analysis:          1. Organize data // getting the right data in the right size and order                     - Sorting : arrange data in meaningful order                     - Filtering : can help find errors or outliers          2. Format and adjust data // filtering or sorting or compiling data in a better
Read more

3. Algorithms - Selection Sort

Selection sort sorts an array by finding the lowest value element and appending it to an empty array. The algorithm will shrink the unsorted array and repeat the process recursively until all unsorted elements are used up. package main func selectionSort (list *[] int ) {     sorted := make ([] int , 0 , len (*list))     unSorted := *list     for i := 0 ; i < len (*list); i++ {         min := unSorted[ 0 ]         index := 0         for i , e := range unSorted {             if e <= min {                 min = e                 index = i             }         }         sorted = append (sorted, (unSorted)[index])         if index == 0 {             unSorted = unSorted[ 1 :]         } else if index == ( len (*list) - 1 ) {             unSorted = unSorted[:index]         } else {             unSorted = append (unSorted[ 0 :index], unSorted[index+ 1 :]...)         }     }     * list = sorted } /*func main() {     x := []int{4, 6, 3, 2, 9, 7, 3, 5}     fmt.Print
Read more