Move to Front/Head Method of Linear search:

# Move to Front/Head Method of Linear search:

In this method of searching, If the key is found then it is swapped with the first element of the array.

The idea behind this method is if the item will be searched again, then the item will search very fast.

Below is the program for this method.

#include <iostream>

using namespace std;

/**
 * @brief The Array struct: Structure Which Contains array of size 10 and arrays
 * Length (number of items it contains.)
 */


struct Array
{
    int A[10];
    int iLength;
};

/**
 * @brief swap: This function swaps the items.
 * @param pFirst: First item.
 * @param pSecond: Second item
 */
void swap(int *pFirst, int *pSecond)
{
    int iTemp;

    iTemp = *pFirst;
    *pFirst = *pSecond;
    *pSecond = iTemp;
}

/**
 * @brief moveToHeadLinearSearch: This methods search the Key in the array passed in first param,
 *                      and if item/key is found then, swap it with the item at 0th index.
 * @param objArr: object of Struct Array, Which contains array and Length of the array,
 *                in which we have to search the key.
 * @param iKey: Key needs to be search.
 * @return if key is found then returns index of key otherwaise -1
 */
int moveToHeadLinearSearch(struct Array objArr, int iKey)
{
    int iKeyIndex = -1;


    for(int i = 0; i < objArr.iLength; ++i)
    {
        if (objArr.A[i] == iKey)
        {
            swap(objArr.A[i], objArr.A[0]);
            iKeyIndex = 0;
            break;
        }
    }


    return iKeyIndex;
}



int main()
{
    Array objArr = {{2, 4, 6, 5, 7}, 5};


    int iIndex = moveToHeadLinearSearch(objArr, 7);


    if (iIndex != -1)
        cout << "Element found at index: " << iIndex << endl;
    else
        cout << "Element not found." << endl;


}

Comments

Post a Comment

Popular posts from this blog

Insert an element in a sorted array

Image
# Insert an element in a sorted array: To insert an element in a sorted array, We have to start comparing the key element with the last element of the array and if the last element is greater than the key element then shift the last element to its next index. This procedure we have to follow until we find the element in array equal to or smaller than the key element. like if we need to insert 5 in below array: then we have to take a variable "i" and "i" will be initialized by array length - 1 So i = A.length - 1 = 5 - 1 = 4; So 5 is compared with A[4], as A[4] is 8 so 8 > 5 , then we have to shift A[i] to A[i+1], A[i+1] = A[i] // A[5] = A[4] // A[5] = 8  and A[4] is empty. and need to do --i, so i will be 3 now now again we have to compare 5 with A[3], as A[3] is 7 and 7 > 5 , So again we have to shift it to the next index. A[i+1] = A[i]; // A[4] = A[3] // A[4] = 7  and A[3] is empty. --i; So i will be 2 now now again we have to compare 5 with A[2], as A[2] is...
Read more

Finding the length of a string in c and c++

Image
# Finding the length of a string in c and c++: # What is a string: A string is a set of characters and string is terminated by a '\0' character. This character is used to know the termination of the string. So to find the length of the above string. We have to traverse this string till we find the '\0'. Please check the below program for more details: # include < iostream > using namespace std ; int main () {      /*   * No need to append '\0' as this is   * added by Compiler automatically as we use "".   */ char * s = "welcome" ; int iLength = 0 ; while ( s [ iLength ] != '\0' ) { ++ iLength ; } cout << "The Length of the string is: " << iLength << endl ; return 0 ; } # Output of the program: Note: Full program can be downloaded from the link below: https://github.com/VChaudhary854/LearnD...
Read more

Transposition Linear Search

Transposition Linear Search: In this algorithm of searching, If the key is found then the key is swapped with the item at (keyIndex - 1) or the item before the search item. The idea behind this algorithm is to move most search item/key to front/head of the array with each search. So that if the same item gets search again then it will take less time to search. Below is the program for this algorithm of searching: # include < iostream > using namespace std ; /** * @brief swap: This function swaps the items. * @param pFirst: First item. * @param pSecond: Second item. */ void swap ( int * pFirst , int * pSecond ) { int iTemp ; iTemp = * pFirst ; * pFirst = * pSecond; * pSecond = iTemp ; } /** * @brief LinearSearch: This methods search the Key in the array passed in first param, * and if item/key is found then, swap it with the item at 1 less index. * @param objArr: object o...
Read more