|
|
| (не показана 1 промежуточная версия 1 участника) |
| Строка 1: |
Строка 1: |
| | Отчет по НИР ([https://drive.google.com/drive/folders/1KSNkIAwYvl4AN0j6iu9Tc5eWMzVfzI_3?usp=sharing ссылка Google Drive]) | | Отчет по НИР ([https://drive.google.com/drive/folders/1KSNkIAwYvl4AN0j6iu9Tc5eWMzVfzI_3?usp=sharing ссылка Google Drive]) |
| − | wiki markdown:
| |
| − | // TODO: confirm Chemical Formula with MathML extension
| |
| − |
| |
| − | ==Heading 1==
| |
| − | ===Heading 2===
| |
| − | ==Chemical Formula==
| |
| − | <chem> CH3-CO-OH </chem>
| |
| − | ==Math Formula==
| |
| − | <math> \frac{&part^2 u}{&part t^2} = c^2 \left( \frac{&part^2 u}{&part x_1^2} + \frac{&part^2 u}{&part x_2^2} + \ldots + \frac{&part^2 u}{&part x_n^2} \right) </math>
| |
| − | ==Code snippet==
| |
| − | {|
| |
| − | <syntaxhighlight lang=cpp>
| |
| − | #include <bits/stdc++.h>
| |
| − | using namespace std;
| |
| − |
| |
| − | // An optimized version of Bubble Sort
| |
| − | void bubbleSort(int arr[], int n)
| |
| − | {
| |
| − | int i, j;
| |
| − | bool swapped;
| |
| − | for (i = 0; i < n - 1; i++) {
| |
| − | swapped = false;
| |
| − | for (j = 0; j < n - i - 1; j++) {
| |
| − | if (arr[j] > arr[j + 1]) {
| |
| − | swap(arr[j], arr[j + 1]);
| |
| − | swapped = true;
| |
| − | }
| |
| − | }
| |
| − |
| |
| − | // If no two elements were swapped
| |
| − | // by inner loop, then break
| |
| − | if (swapped == false)
| |
| − | break;
| |
| − | }
| |
| − | }
| |
| − | // Function to print an array
| |
| − | void printArray(int arr[], int size)
| |
| − | {
| |
| − | int i;
| |
| − | for (i = 0; i < size; i++)
| |
| − | cout << " " << arr[i];
| |
| − | }
| |
| − |
| |
| − | // Driver program to test above functions
| |
| − | 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;
| |
| − | }
| |
| − | </syntaxhighlight>
| |
| − | |}
| |
