Learn Computer Programming @LearnComputerP1

We at FirstClick sincerely hope to use this avenue to impact knowledge to those who show interest in learning computer programming. You don't have to pay. Joined December 2020

Tweets

53
Followers

57
Following

6
Likes

0

Learn Computer Programming @LearnComputerP1

4 years ago

In this tutorial i am going to show you how to find duplicates in a string using bitwise operations. This method has advantage over the other methods in that it takes O(n) time and O(1) extra or auxiliary space. firstclicklimited.com/tutorials/inde…

0 0 0 0 0

Download Image

Learn Computer Programming @LearnComputerP1

4 years ago

web.facebook.com/groups/1160321…

0 0 0 0 0

Learn Computer Programming @LearnComputerP1

4 years ago

Implement the function void reverse(struct node **head) which takes one argument. &head - Address of the head node. Your task is to reverse the given linked list.

0 0 0 0 0

Download Image

Learn Computer Programming @LearnComputerP1

4 years ago

Another scenario where you can use pointer to pointer in c is when you want to avoid a dangling or a null pointer. This happens when a pointer variable defined in one function is made to ... Click here firstclicklimited.com/tutorials/inde… to continue reading.

0 0 0 0 0

Download Image

Learn Computer Programming @LearnComputerP1

4 years ago

Learn Computer Programming @LearnComputerP1 · 43s To analyze the time complexity of any recursive function, we need to know the recurrence relation (We take the individual runtime of the recursive calls in the recursive function and sum them up...) firstclicklimited.com/tutorials/inde…

0 0 0 0 0

Download Image

Learn Computer Programming @LearnComputerP1

4 years ago

In time complexity analysis each statement in the algorithm takes 1 unit of time to perform its task. So looking at this function: total = 0 takes 1 unit of time, return total takes 1 unit of time and the total time taken therefore is 1+1=2. Detail here firstclicklimited.com/tutorials/inde…

0 0 0 0 0

Download Image

Learn Computer Programming @LearnComputerP1

4 years ago

If i have some natural numbers say: 1, 2, 3, 4, 5, 6, 7 and i want the summation of these numbers, how do i solve it recursively? The recurrence relation for the sum of first n natural numbers will be as shown in the image. Click here firstclicklimited.com/.../recursion-… for the solution

0 0 1 0 0

Download Image

Learn Computer Programming @LearnComputerP1

4 years ago

The divide and conquer strategy says that if a problem is large, then break the problem into sub-problems and solve them; then combine the solutions of the sub-problems to get the solution of the large problem.firstclicklimited.com/tutorials/inde…

0 0 0 0 0

Learn Computer Programming @LearnComputerP1

4 years ago

Sorting Algorithms Bubble Sort Insertion Sort Selection Sort Heap Sort Merge Sort Quick Sort Tree Sort Shell Sort Count Sort Bucket/Bin Sort Radix Sort web.facebook.com/groups/1160321…