list_array.cpp File Reference

Dynamic Array More...

#include <iostream>
#include <array>
#include <cassert>

Include dependency graph for list_array.cpp:

Classes
struct	data_structures::list_array::list< N >
	Structure of List with supporting methods. More...

Namespaces
namespace	data_structures
	for IO operations
namespace	list_array
	Functions for Dynamic Array algorithm.

Functions
static void	test ()
	Test implementations.
int	main ()
	Main function.

Detailed Description

Dynamic Array

The list_array is the implementation of list represented using array. We can perform basic CRUD operations as well as other operations like sorting etc.

Algorithm

It implements various method like insert, sort, search etc. efficiently. You can select the operation and methods will do the rest work for you. You can insert element, sort them in order, search efficiently, delete values and print the list.

Function Documentation

main()

int main

(

void

)

Main function.

Returns

0 on exit

           {
    test(); // Execute the tests
    return 0;
}

Here is the call graph for this function:

test()

static void test ( )

static

Test implementations.

Returns

void

                   {
    data_structures::list_array::list<50> L;
 
    // Insert testing
    L.insert(11);
    L.insert(12);
    assert(L.top == 2);
    L.insert(15);
    L.insert(10);
    L.insert(12);
    L.insert(20);
    L.insert(18);
    assert(L.top == 7);
    L.show(); // To print the array
 
    // Remove testing
    L.remove(12); // Remove Duplicate value in the list
    L.remove(15); // Remove the existing value in the list
    assert(L.top == 5);
    L.remove(50); // Try to remove the non-existing value in the list
    assert(L.top == 5);
 
    // LinearSearch testing
    assert(L.search(11) == 0); // search for the existing element
    assert(L.search(12) == 2);
    assert(L.search(50) == -1); // search for the non-existing element
 
    // Sort testing
    L.sort();
    assert(L.isSorted == true);
    L.show();
 
    // BinarySearch testing
    assert(L.search(11) == 1); // search for the existing element
    assert(L.search(12) == 2);
    assert(L.search(50) == -1); // search for the non-existing element
}

Here is the call graph for this function: