This Project aims to contains all types of programs of the all languages.
Contains the basic syntax of the programming language printing Hello World! program.
An array is collection of items stored at contiguous memory locations. The idea is to store multiple items of same type together. This makes it easier to calculate the position of each element by simply adding an offset to a base value, i.e., the memory location of the first element of the array (generally denoted by the name of the array).
Like arrays, Linked List is a linear data structure. Unlike arrays, linked list elements are not stored at contiguous location; the elements are linked using pointers. Linked List uses random variable allocation.
Stack is a linear data structure which follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). In Stack the element which is added at last is removed first.
A Queue is a linear structure which follows a particular order in which the operations are performed. The order is First In First Out (FIFO). In Queue the element which is added first is removed first.
A tree data structure can be defined recursively as a collection of nodes (starting at a root node), where each node is a data structure consisting of a value, together with a list of references to nodes (the "children"), with the constraints that no reference is duplicated, and none points to the root.
- Linear Search
- Binary Search
- Bubble Sort
- Radix Sort
- Heap Sort
- Insertion Sort
- Selection Sort
- Merge Sort
- Quick Sort