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 StructureThis is a Music Album implemented in a doubly list. Play backward is feaseble o/…Sequential Search
Sorting algorithm
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.
(Wikipedia)
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)
Inventor…
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.
Hash tables A hash table uses a hash function to compute an index, also called a hash code, into an array of buckets or slots, from which the desired value can be found. …
This is a deque implementation. It is a J3 MUSIC ALBUM!
It’s from academic work (see requerements below).
It simulate a playlist on the console.
Pre load file available.
See Visual Code Projects 05,06,07, and 08 in my repo.
These 4 project help me find this solution.
Enjoy!
Welcome!
…
Welcome! in this post we will see how we can set up the Visual Studio Code for writing and executing the C/C++ programs.
1#Step — You Will need:
tdm-gcc
visualstudio.comThese are the C and C++ toolset and Visual Studio Code installer.
2#Step — So now first let us open…
Graphs are networks consisting of nodes connected by edges or arcs.
In directed graphs, the connections between nodes have a direction, and are called arcs;
in undirected graphs, the connections have no direction and are called edges.
We mainly discuss directed graphs.
Algorithms in graphs include finding a path between…
How to Use List Comprehension;
The Difference between FOR and List Comprehension;
Using tuples to ensure maintenance of the order of dependent lists;
Applying List Comprehension In Classification Using Tuples;
How to Filtering Using IF CONDITION inside a List Comprehension;
IF ELSE of List Comprehension;
Does list comprehension always create a list in Python…
