inspire

Welcome Back!  In the heart of our bustling city, where pollution in the surrounding and environment rush through concrete canyons, there exists a bridge a relic of the past, a thread connecting our urban fabric. Maya, a woman, walks this bridge every morning, her footsteps echoing against the worn-out pavement. The bridge spans a murky river, its iron railings rusted and chipped. As Maya steps onto it, she gazes at the surrounding buildings. They loom like silent sentinels, their windows cracked, graffiti defacing their once-pristine facades. These structures, once symbols of progress, now bear the scars of neglect. Maya's eyes sweep across the landscape. She notices the shattered glass of a bus stop, the faded murals on the walls, and the litter strewn about a testament to our collective disregard for public spaces. The bridge itself groans under the weight of years, its concrete pockmarked and crumbling. But Maya is not a passive observer. She carries a small bag a makeshift too...

Linked List A linked list is a linear data structure that does not store elements in contiguous memory locations, the elements in the linked list are linked using pointers. It is a collection of nodes in which each node stores data and a pointer that links to the next node to form a sequence of nodes. -> Linked List is a linear data structure which is a combination of Nodes. -> Nodes contain two parts i.e. data & address. Representation of a Linked List in C: A linked list is represented as a pointer to the first node where each node contains: Data:  Here the actual information is stored. Next:  Pointer that links to the next node. Advantages of a Linked List: Linked list is dynamic data structure it has memory allocation and de-allocation, which means that memory is only used when needed and not earlier in order to avoid waste. In linked list items are arranged in a linear fashion, new items can be inserted or removed as and when needed without affecting other items...

Binary Search: Algorithms What is Binary Search? Binary Search is an interval searching algorithm used to search for an item in the sorted list. It works by repeatedly dividing the list into two equal parts and then searching for the item that is the part where it can possibly exist. Unlike linear search, there are a few conditions for applying binary search: The list must be sorted. Random access to the list member. It means that we cannot apply the binary search in unsorted or liked data structures. Visualization of Binary Search: Algorithm for Binary Search in C Let [X]   be the element we are searching for, and the array is sorted in the ascending order. Compare [X] with the middle element of the array.   If [X]  matches with the middle element, we return the index of the middle element.   Else if [X]  is greater than the middle element, it means that [X]  can only lie in the right half subarray after the middle element. So, we repeat steps 1 and 2 for ...

Hello everyone, I’m Harilal Sah Kanu, and I’m thrilled to share my journey from the serene landscapes of Nepal to the bustling educational environment of India, where I’m currently pursuing my dream in Computer Science Engineering (CSE) at Parul University. My journey began in the beautiful and culturally rich country of Nepal. Growing up in this vibrant land, I was always fascinated by technology and the potential it held. My formal introduction to the world of computing came during my time at Shree Durga Model Secondary School. It was here, in the 10th standard, that I encountered my first programming language. The experience of writing my first code, a simple "Hello, World!" program in C, was nothing short of magical. It was as if I had unlocked a door to a new dimension where creativity and logic merged seamlessly. This moment sparked a profound interest in the field of Computer Science, shaping my future aspirations. After completing my secondary education, I pursued my ...