這裡我們將看到如何應用多執行緒概念來搜尋陣列中的一個元素。這裡的方法非常簡單。我們將建立一些線程,然後將數組分成不同的部分。不同的執行緒會在不同的部分進行搜尋。之後,當找到該元素時,請啟用標誌來識別該元素。
#include <stdio.h> #include <pthread.h> #define MAX 16 #define THREAD_MAX 4 int array[MAX] = { 1, 5, 7, 10, 12, 14, 15, 18, 20, 22, 25, 27, 30, 64, 110, 220 }; int key = 18; int flag = 0; //flag to indicate that item is found in the array or not int current_thread = 0; void* ThreadSearch(void* args) { //This is linear search function. It will be running using all threads int num = current_thread++; for (int i = num * (MAX / 4); i < ((num + 1) * (MAX / 4)); i++){ if (array[i] == key) flag = 1; //set flag if key is found } } int main() { pthread_t thread[THREAD_MAX]; for (int i = 0; i < THREAD_MAX; i++) { //create multiple threads pthread_create(&thread[i], NULL, ThreadSearch, (void*)NULL); } for (int i = 0; i < THREAD_MAX; i++) { pthread_join(thread[i], NULL); //wait untill all of the threads are completed } if (flag == 1) printf("Key element is found</p><p>"); else printf("Key element is not present</p><p>"); }
$ gcc 1249.Thread_search.cpp -lpthread $ ./a.out Key element is found
以上是在C語言中使用多執行緒進行線性搜索的詳細內容。更多資訊請關注PHP中文網其他相關文章!