(Linear Search) Algorithm na Bincike na Layi a cikin Java: Bincika da Neman Abubuwa

Algorithm na Neman Linear hanya ce mai sauƙi kuma mai mahimmanci a cikin Java shirye-shirye, ana amfani da ita don nemo takamaiman abu a cikin jeri ko tsararru. Wannan hanya tana aiki ta hanyar ratsa kowane nau'i kuma kwatanta shi da ƙimar bincike.

Yadda Algorithm na Bincike na Linear ke Aiki

Algorithm na Bincike na layi yana farawa daga kashi na farko na jeri ko tsararru. Yana kwatanta ƙimar bincike tare da ƙimar abin da ke yanzu. Idan an sami madaidaicin ƙima, algorithm ɗin yana mayar da matsayin kashi a cikin jeri ko tsararru. Idan ba a samo shi ba, algorithm yana ci gaba da motsawa zuwa kashi na gaba kuma ya ci gaba da tsarin kwatanta har sai an sami darajar ko duk abubuwa sun keta.

Abũbuwan amfãni da rashin amfani Algorithm na Bincike na Lissafi

Amfani:

• Mai Sauƙi kuma Mai Fahimta: Wannan algorithm yana da sauƙin aiwatarwa da fahimta.
• Yana aiki tare da Kowane Nau'in Bayanai: Ana iya amfani da bincike na linzamin kwamfuta zuwa kowane nau'in jeri ko bayanan tsararru.

Rashin hasara:

• Ƙarƙashin Ƙarfafawa: Wannan algorithm yana buƙatar wucewa ta duk abubuwan da ke cikin jeri ko tsararru, wanda zai iya haifar da ƙarancin aiki don manyan bayanan bayanai.

Misali da Bayani

Yi la'akari da misali na amfani da Algorithm na Bincike na Linear don nemo takamaiman lamba a cikin tsararrun lamba a cikin Java.

public class LinearSearchExample {  
    public static int linearSearch(int[] array, int target) {  
        for(int i = 0; i < array.length; i++) {  
            if(array[i] == target) {  
                return i; // Return position if found  
            }  
        }  
        return -1; // Return -1 if not found  
    }  
  
    public static void main(String[] args) {  
        int[] numbers = { 4, 2, 7, 1, 9, 5 };  
        int target = 7;  
  
        int position = linearSearch(numbers, target);  
  
        if(position != -1) {  
            System.out.println("Element " + target + " found at position " + position);  
        } else {  
            System.out.println("Element " + target + " not found in the array");  
        }  
    }  
}  

A cikin wannan misali, muna amfani da Algorithm na Bincike na Linear don nemo lamba 7 a cikin tsararrun lamba. Algorithm din yana ratsa kowane kashi kuma yana kwatanta shi da ƙimar bincike. A wannan yanayin, ana samun lamba 7 a matsayi na 2(0-based index) a cikin tsararru.

Duk da yake wannan misalin yana nuna yadda Algorithm na Bincike na Linear zai iya samun wani abu a cikin tsararrun lamba, kuma ana iya amfani da shi zuwa wasu yanayin bincike a cikin Java shirye-shirye.