The geek's Coding education and Review centre
The C programming technique of allocating necessary memory to hold data during runtime is known as dynamic memory allocation. We’re sure you’re familiar with arrays. When you want to process data and you know how big it is, an array is the ideal option. Assume you’re reading data from a file or accepting keyboard input….
Read More “Dynamic memory allocation in C using malloc, realloc, calloc and free” »
A linked list is a data structure that simulates a dynamic list of data items without knowing the size at compile time. During the runtime, the linked list may grow or shrink. We are all familiar with the idea of an array, which is represented in memory using sequential mapping. It has a fixed size….
Read More “Linked List in Data Structure and Algorithm, Types, Operations” »
The linear search algorithm is a very simple and straightforward in data structure. A linear search is also known as a sequential search. If the list or array is unordered, the linear search is preferable. Linear search is an excellent approach to find elements, however we must check each element of the array or list…
Read More “Linear search algorithm | Linear search program in C, Example” »
If you have a sorted array, binary search algorithm is the quickest way. In a sorted array or list, binary search is used to increase the speed of the search operation. You might be wondering why we would want to arrange the array in that particular order? The benefit of structuring the array is that…
Read More “Binary search algorithm in C, Recursive, Iterative, examples” »
In a data structure, the bubble sort algorithm is the most basic sorting approach. Bubble sort employs the swapping approach, in which we swap the elements of an array. We have an array in this example, and we will sort it in ascending order. Steps for Bubble Sort Data Structure If the first element in…
Read More “Bubble Sort Algorithm in Data Structure | Bubble Sort Example” »
