Merging in Git
First, make the changes in the branch created and commit the changes to the branch. Now, checkout the master branch.. Then issue the following command
git merge branch_name_to_commit

No title available
YOU ARE THE REASON
Jules of Nature
Peter Solarz

ellievsbear
No title available
One Nice Bug Per Day
Monterey Bay Aquarium
DEAR READER
trying on a metaphor
ojovivo

Kaledo Art
taylor price

JBB: An Artblog!
Game of Thrones Daily
Claire Keane

⁂
"I'm Dorothy Gale from Kansas"
Sade Olutola
AnasAbdin
seen from United States

seen from Spain

seen from Egypt
seen from Philippines
seen from United States

seen from Türkiye

seen from Singapore

seen from United States

seen from United States
seen from Türkiye

seen from United States
seen from United States
seen from Italy

seen from United States
seen from United States
seen from United States
seen from United States
seen from United States
seen from Greece

seen from Brazil
@saninnovator
Merging in Git
First, make the changes in the branch created and commit the changes to the branch. Now, checkout the master branch.. Then issue the following command
git merge branch_name_to_commit
Git Process
Use the git init command to initiate the git repository. Then use the git add command to add the changes. Use git commit and push to local branch. Before all of these create a new repo in the github. Then link the local repo to remote repo and do a git pull and then use the git push -u origin master.
Git Learning
git init
git status
git add filename.txt
git status
git commit -m “message for the commit”
git add “*.filetype”
git log
git remote add origin https://github.com/try-git/try_git.git creates a remote repository named origin.
git push -u origin(dest) master(src)
The name of our remote is origin and the default local branch name is master. The -u tells Git to remember the parameters, so that next time we can simply run git push and Git will know what to do
git pull origin(remote branch name) master(local branch name)
git diff HEAD
git diff --staged
git reset foldername/filename resets the unstaged commit
git checkout --<target> So you may be wondering, why do I have to use this '--' thing? git checkoutseems to work fine without it. It's simply promising the command line that there are no more options after the '--'. This way if you happen to have a branch named octocat.txt, it will still revert the file, instead of switching to the branch of the same name.
git branch branch_name creates a new branch
git checkout -b new_branch creates a branch with name new_branch and checkouts it
git checkout new_branch switches to new_branch
git rm ‘*.txt’
git merge new_branch goto the master branch and merge the local_branch named new_branch
git branch -d new_branch(deletes the branch only when changes are merged. delete before merge use the option --force or -f along wih -d or directly use -D )
git stash
git stash apply
CSS
Measurements are of two types.
Absolute : Fixed (px, in, pt, cm, pc)
Relative : Relative to other elements.( em , ex )
1px = 1/96th of 1 inch
1pt =1/72 of inch
Diff between Scanner vs BufferedReader
http://stackoverflow.com/questions/2231369/scanner-vs-bufferedreader
Google Prep
https://code.google.com/p/prep/wiki/ExercisesList
Stack vs Heap
http://stackoverflow.com/questions/79923/what-and-where-are-the-stack-and-heap
Selection Sort
Algorithm Name: Selection Sort
Algorithm Description:
Algorithm Steps:
Assume Minimum Element as the starting element.
Iterate the array from the next element other than the first element.
Find the minimum index of the element.
Swap the element if the minimum index is not equal to the initial assumption
Code:
public void selectionSortArray(int[] elements)
{
int sMin=0,temp;
for (int i = 0; i < elements.length; i++) {
sMin=i;
for(int j=i+1;j<elements.length;j++)
{
if(elements[sMin]>elements[j]){
sMin=j;
}
}
if(sMin!=i)
{
temp=elements[sMin];
elements[sMin]=elements[i];
elements[i]=temp;
}
}
}
Efficiency: O(n2)
Good Links:
Selection Sort
Bubble Sort
Algorithm Name: Bubble Sort
Algorithm Description: Bubble Sort is a simple sorting algorithm used for sorting elements.
Algorithm Steps:
Every element is compared with the adjacent element.
If adjacent is greater swap the element.
Repeat this until all the elements are sorted.
Code:
public void bubbleSortArray(int[] elements) { for(int i=0;i<elements.length;i++) { for(int j=0;j<elements.length-1;j++) { if(elements[j]>elements[j+1]) { int temp=elements[j]; elements[j]=elements[j+1]; elements[j+1]=temp; } } } } Efficiency: O(n2)
Good Links:
Bubble Sort
CLEAN CODE INDENTATION
WRITE CODE WITHOUT LOOPS
DON'T KILL UR DREAMS
Technology at the Best!!!!!
As an introduction,I just wanna mention that this blog is going publish the latest trends in Technology.My approach to Technology..etc..