Skip to content

patch #130

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.

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
wants to merge 4 commits into
base: master
Choose a base branch
from
Open

patch #130

Show file tree
Hide file tree
Changes from all commits
Commits
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
17 changes: 17 additions & 0 deletions add 2 num
Original file line number Diff line number Diff line change
@@ -0,0 +1,17 @@
#include <iostream>
using namespace std;

int main() {
double num1, num2, product;
cout << "Enter two numbers: ";

// stores two floating point numbers in num1 and num2 respectively
cin >> num1 >> num2;

// performs multiplication and stores the result in product variable
product = num1 * num2;

cout << "Product = " << product;

return 0;
}
17 changes: 17 additions & 0 deletions add 2 numbers
Original file line number Diff line number Diff line change
@@ -0,0 +1,17 @@
#include <iostream>
using namespace std;

int main() {
double num1, num2, product;
cout << "Enter two numbers: ";

// stores two floating point numbers in num1 and num2 respectively
cin >> num1 >> num2;

// performs multiplication and stores the result in product variable
product = num1 * num2;

cout << "Product = " << product;

return 0;
}
44 changes: 44 additions & 0 deletions bubble_sort.cpp
Original file line number Diff line number Diff line change
@@ -0,0 +1,44 @@
// C++ program for implementation of Bubble sort
#include <bits/stdc++.h>
using namespace std;

void swap(int *xp, int *yp)
{
int temp = *xp;
*xp = *yp;
*yp = temp;
}

// A function to implement bubble sort
void bubbleSort(int arr[], int n)
{
int i, j;
for (i = 0; i < n-1; i++)

// Last i elements are already in place
for (j = 0; j < n-i-1; j++)
if (arr[j] > arr[j+1])
swap(&arr[j], &arr[j+1]);
}

/* Function to print an array */
void printArray(int arr[], int size)
{
int i;
for (i = 0; i < size; i++)
cout << arr[i] << " ";
cout << endl;
}

// Driver code
int main()
{
int arr[] = {64, 34, 25, 12, 22, 11, 90};
int n = sizeof(arr)/sizeof(arr[0]);
bubbleSort(arr, n);
cout<<"Sorted array: \n";
printArray(arr, n);
return 0;
}

// This code is contributed by Midhun