Skip to content

Update reverse.java #122

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

Open
jyotisingla08 wants to merge 2 commits into
base: master
Choose a base branch
from
Open

Update reverse.java #122

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
f1e69fd
Update reverse.java
jyotisingla08 Oct 4, 2021
a16924f
Update binary_search.C
jyotisingla08 Oct 4, 2021
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 2 additions & 0 deletions C/binary_search.C
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -9,6 +9,7 @@ int main()
{
scanf("%d", &a[i]);
}
//sort the elements
for(i=0;i<n;i++)
{
for(j=i+1;j<n;j++)
Expand All @@ -29,6 +30,7 @@ int main()
scanf("%d", &search);
beg=0;
end=n-1;
//find middle element
mid=(beg+end)/2;
while(beg<=end)
{
Expand Down
2 changes: 2 additions & 0 deletions Java/reverse.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -5,8 +5,10 @@ public static void main(String args[])
{
Scanner scan=new Scanner(System.in);
int n=scan.nextInt();
//Input integers
Stack<Integer> s=new Stack<Integer>();
int digit,count=0;
//Add to stack
while(n!=0)
{
digit=n%10;
Expand Down