#include<iostream> #include<vector> using namespace std;int msearch(int a[], int low, int high) { //折半查找法int key = 17;int pose = 0;while (low <= high){pose = (low + high) / 2;if (key < a[pose])high = pose - 1;else if (key > a[pose])low = pose + 1;else if (key == a[pose]){cout << "b組17的下標為:" << pose + 1 << endl;return pose;}}if (low > high)return -1; }int msearch1(int a[]) //順序查找法 {for (int k = 0; k < 5; k++){int row;if (a[k] == 17){row = k;cout << "a組17下標為：" << row + 1 << endl;break;}elsecontinue;}return 0; }void mysort(vector<int>v) //選擇排序法 {for (int k = 0; k < v.size(); k++){int max = k;for (int i = k + 1; i < v.size(); i++){if (v[max] < v[i]){max = i;}}if (max != k){int t = v[k];v[k] = v[max];v[max] = t;}}for (int a = 0; a < v.size(); a++){cout << v[a] << '\t';}}void prime(vector<int> v1) {for (int k = 0; k < v1.size(); k++){for (int factor = 2; factor < v1[k]; factor++){if (v1[k] % factor == 0){break;}if (factor == v1[k] - 1){cout << "數組中的素數有" << v1[k] << endl;}}} }int main() {int a[5] = { 19,67,24,11,17 };int b[5] = { 2,3,9,17,59 };msearch1(a);msearch(b, 0, 4);vector<int> v1;for (int i = 0; i < 5; i++){v1.push_back(a[i]);}for (int i = 0; i < 5; i++){for (int j = 0; j < 5; j++){if (b[i] == a[j]){break;}if (b[4] != a[4] && j == 4){v1.push_back(b[i]);}}}prime(v1);mysort(v1);return 0; }

總結

以上是生活随笔為你收集整理的1218上机2的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。