Are you Full Stack Developer?
What, btw, is A full Stack Web Developer? Answer: Aha! Of Course! is a person who can develop both client and server software, simple like that!
Well, At the last 2 years I have taken Python Course, and here is a new one:
As in the first Episode of #DjangoSeries, published some time ago, we used Atom, but let’s start Django App all over again, from the scratch…
See this scenario:
A Compatibility issues come up when users are using the same type of software for a task, such as word processors, that cannot communicate with each other. This could be due to a difference in their versions or because they are made by different companiesNow you…
This is the last episode of #CSeries.
This code was based on this book.
Beginning C From Novice to Professional 4th Edition Pg 418 Author Ivor Horton Chap 11 - Dynamic Memory Allocation for Structure
This is a Music Album implemented in a doubly list. Play backward is feaseble o/
In computer science, a linear search or sequential search is a method
for finding an element within a list. It sequentially checks each
element of the list until a match is found or the whole list has been searched.
Worst complexity: O(n)
Average complexity: O(n)
Quicksort is an in-place sorting algorithm.
Developed by British computer scientist Tony Hoare in 1959 and published in 1961, it is still a commonly used algorithm for sorting.
When implemented well, it can be somewhat faster than merge sort and about two or three times faster than heapsort. (WIKIPEDIA)
Bubble Sorting algorithm works by repeatedly SWAPPING the ADJACENT ELEMENTS if they are in wrong order.
Worst case: O(n²)
1- Two loops:
-external -> sweep vector size
-internal -> compares 2x2 and SWAP using Auxiliary Variable (aux)The 1st, Loops to vector size; the 2st, Loops from 1st to penultimate…
As said in the previous episode, this post reuses the previous code to implement a hashtable student catalog. Welcome!
This is a HashTable which implements a hash function.
A hash function turns a key into a random-looking number, and it must always return the same number given the same key.
This is a hashtable implementation.