いろいろなテクニック.Nucleo と DISCO-F746 用.
Dependencies: Array_Matrix mbed
MySort.hpp@1:bbb9f0c3e523, 2019-04-10 (annotated)
- Committer:
- MikamiUitOpen
- Date:
- Wed Apr 10 06:32:33 2019 +0000
- Revision:
- 1:bbb9f0c3e523
- Parent:
- 0:bb939e0bc6e2
2
Who changed what in which revision?
User | Revision | Line number | New contents of line |
---|---|---|---|
MikamiUitOpen | 0:bb939e0bc6e2 | 1 | #include "mbed.h" |
MikamiUitOpen | 0:bb939e0bc6e2 | 2 | #include <algorithm> |
MikamiUitOpen | 0:bb939e0bc6e2 | 3 | #include <string> |
MikamiUitOpen | 0:bb939e0bc6e2 | 4 | |
MikamiUitOpen | 0:bb939e0bc6e2 | 5 | void MySort() |
MikamiUitOpen | 0:bb939e0bc6e2 | 6 | { |
MikamiUitOpen | 0:bb939e0bc6e2 | 7 | printf("\r\n\"MySort\" の開始\r\n"); |
MikamiUitOpen | 0:bb939e0bc6e2 | 8 | |
MikamiUitOpen | 0:bb939e0bc6e2 | 9 | // 配列を昇順にソートする |
MikamiUitOpen | 0:bb939e0bc6e2 | 10 | const int N = 6; |
MikamiUitOpen | 0:bb939e0bc6e2 | 11 | string data0[N] = {"const", "Printf", "Int", "for", "array", "Vector"}; |
MikamiUitOpen | 0:bb939e0bc6e2 | 12 | printf("ソート前:\r\n"); |
MikamiUitOpen | 0:bb939e0bc6e2 | 13 | for (int n=0; n<N; n++) |
MikamiUitOpen | 0:bb939e0bc6e2 | 14 | printf(" %s\r\n", data0[n].c_str()); |
MikamiUitOpen | 0:bb939e0bc6e2 | 15 | |
MikamiUitOpen | 1:bbb9f0c3e523 | 16 | // string *data1 = new string[N]; |
MikamiUitOpen | 1:bbb9f0c3e523 | 17 | string data1[N]; // これでもよい |
MikamiUitOpen | 0:bb939e0bc6e2 | 18 | for (int n=0; n<N; n++) data1[n] = data0[n]; |
MikamiUitOpen | 0:bb939e0bc6e2 | 19 | sort(data1, data1+N); // 配列 |
MikamiUitOpen | 0:bb939e0bc6e2 | 20 | printf("ソート後:\r\n"); |
MikamiUitOpen | 0:bb939e0bc6e2 | 21 | for (int n=0; n<N; n++) |
MikamiUitOpen | 0:bb939e0bc6e2 | 22 | printf(" %s\r\n", data1[n].c_str()); |
MikamiUitOpen | 0:bb939e0bc6e2 | 23 | |
MikamiUitOpen | 0:bb939e0bc6e2 | 24 | printf("\"MySorth\" の終了\r\n"); |
MikamiUitOpen | 1:bbb9f0c3e523 | 25 | // delete [] data1; // data1 に new で確保した領域を割り当てない場合は,これは不要 |
MikamiUitOpen | 0:bb939e0bc6e2 | 26 | } |
MikamiUitOpen | 0:bb939e0bc6e2 | 27 | |
MikamiUitOpen | 0:bb939e0bc6e2 | 28 | // array, vector を昇順にソートする |
MikamiUitOpen | 0:bb939e0bc6e2 | 29 | // 「array」,「vector」 |
MikamiUitOpen | 0:bb939e0bc6e2 | 30 | //array<int,N> ar; |
MikamiUitOpen | 0:bb939e0bc6e2 | 31 | //vector<int> v; |
MikamiUitOpen | 0:bb939e0bc6e2 | 32 | //sort(ar.begin(), ar.end()); // array |
MikamiUitOpen | 0:bb939e0bc6e2 | 33 | //sort(v.begin(), v.end()); // vector |