InsertionSort.h File Reference

Headers for the file that contains array management routines (Insertion Sort). More...

Go to the source code of this file.

Functions
BOOLEAN	InsertionSortInsertItem (UINT64 ArrayPtr[], UINT32 *NumberOfItems, UINT32 MaxNumOfItems, UINT32 *Index, UINT64 Key)
	Function to implement insertion sort.
BOOLEAN	InsertionSortDeleteItem (UINT64 ArrayPtr[], UINT32 *NumberOfItems, UINT32 Index)
	Function to implement insertion sort.

Detailed Description

Headers for the file that contains array management routines (Insertion Sort).

Author

Mohammad K. Fallah (mkf19.nosp@m.80@g.nosp@m.mail..nosp@m.com)

Version

0.6

Date

2023-08-21

Copyright

This project is released under the GNU Public License v3.

Function Documentation

InsertionSortDeleteItem()

BOOLEAN InsertionSortDeleteItem	(	UINT64	ArrayPtr[],
		UINT32 *	NumberOfItems,
		UINT32	Index )

Function to implement insertion sort.

Parameters

ArrayPtr
NumberOfItems
Index

Returns

BOOLEAN

{
    //
    // check if index is valid
    //
    if (Index >= *NumberOfItems)
    {
        return FALSE;
    }
 
    for (SIZE_T i = Index + 1; i < *NumberOfItems; i++)
    {
        ArrayPtr[i - 1] = ArrayPtr[i];
    }
 
    (*NumberOfItems)--;
 
    return TRUE;
}

InsertionSortInsertItem()

BOOLEAN InsertionSortInsertItem	(	UINT64	ArrayPtr[],
		UINT32 *	NumberOfItems,
		UINT32	MaxNumOfItems,
		UINT32 *	Index,
		UINT64	Key )

Function to implement insertion sort.

Parameters

ArrayPtr
NumberOfItems
MaxNumOfItems
Index
Key

Returns

BOOLEAN

{
    UINT32 Idx;
 
    if (*NumberOfItems >= MaxNumOfItems)
    {
        //
        // Array list is full
        //
        return FALSE;
    }
 
    Idx = *NumberOfItems;
 
    //
    // Move elements of Arr[0..i-1], that are greater than Key,
    // to one position ahead of their current position
    //
    while (Idx > 0 && ArrayPtr[Idx - 1] > Key)
    {
        ArrayPtr[Idx] = ArrayPtr[Idx - 1];
        Idx           = Idx - 1;
    }
    ArrayPtr[Idx] = Key;
    *Index        = Idx;
    (*NumberOfItems)++;
 
    //
    // Successfully inserted
    //
    return TRUE;
}