Quicksort Algorithm — Lomuto vs Hoare, With Code in C, C++, Java, Python and C#
On 5,000 sorted values a last-element pivot makes 12.5 million comparisons instead of 67,000. Quicksort, measured — with code in five languages.
Computer Science Tutorials — Algorithms, Data Structures, OOP and Programming Styles
Computer science is the intellectual foundation beneath every line of code you write. While programming teaches you how to instruct a computer, computer science teaches you why certain approaches work better than others — why one algorithm processes a million records in seconds while another takes hours, why the right data structure makes the difference between elegant and unworkable code, and why the principles of object-oriented design produce software that survives contact with the real world.
MYCPLUS has been publishing computer science tutorials and practical programming guides since 2004, building a comprehensive resource covering the core theoretical and applied topics that every serious programmer needs to understand. This Computer Science hub brings together four interconnected areas of study — Algorithms, Data Structures, Object-Oriented Programming and Programming Styles — each with its own dedicated section of in-depth tutorials, practical examples and working source code.
Tis section gives you the theoretical understanding and hands-on programming experience to write better software, solve harder problems and think more clearly about how programs work. Whether you are studying for exams, preparing for technical interviews or simply becoming a stronger programmer — start here.
What You’ll Learn
- Algorithms — sorting, searching, graph traversal, dynamic programming and optimisation techniques with working C implementations and complexity analysis for real-world problem solving
- Data structures — arrays, linked lists, stacks, queues, trees, hash tables and graphs with practical C and C++ source code examples and guidance on choosing the right structure for every problem
- Object-oriented programming — the complete OOP model including encapsulation, inheritance, polymorphism and abstraction with practical examples across C++, Java and C# for real-world software design
- Programming styles and paradigms — procedural, object-oriented, functional and declarative programming approaches with examples showing how modern developers apply multiple paradigms in professional codebases
- Algorithm complexity and analysis — understanding Big O notation, time and space complexity, best and worst case analysis and applying complexity thinking to write more efficient everyday code
- Applied computer science — bridging theory and practice by applying computer science principles to real programming problems in C, C++ and Java with source code you can study and build on immediately
Explore the four core areas covered in this section:
→ Algorithms — sorting, searching, graph traversal and optimisation
→ Data Structures — arrays, linked lists, trees, stacks and graphs
→ Object-Oriented Programming — classes, inheritance and polymorphism
→ Programming Styles — procedural, functional and declarative paradigms
Why MYCPLUS: Trusted by programmers and computer science students since 2004 — MYCPLUS covers all four core computer science disciplines in one place, with practical implementations in C, C++ and Java designed for both academic study and real-world software development.
Top 10 Algorithms Every Programmer Should Know (With Code and Complexity)
At n = 1,000,000, O(log n) takes 20 steps and O(n squared) takes a trillion. The ten families that matter, with complexity for each.
Trie Data Structure Explained — Implementation in C++ with Applications
Prefix lookups that scale with the prefix, not the dictionary — and the memory bill that pays for them, measured on 76,226 words.
Fibonacci Series in C and C++: Loops, Recursion, Memoization and Limits
Four ways to compute Fibonacci numbers in C and C++, with measured call counts and the exact term at which each integer type stops being correct.
Kruskal’s Algorithm in C and C++ (Minimum Spanning Tree)
Kruskal’s algorithm builds a minimum spanning tree by sorting edges and rejecting cycles with union-find. Tested C, C++, and Python code included.
Shell Sort Algorithm: C, C++, Java, Python & C# Code
Shell Sort improves insertion sort by sorting far-apart elements first. See how it works, why gap sequences matter, and tested code in five languages.
Linked List in C: Complete Guide with Operations and Examples
A linked list in C chains heap-allocated nodes through pointers. Build one completely: all operations, complexity analysis and a tested full program.
Binary Decision Diagrams (BDD) — Complete Guide with Implementation & Applications
Binary Decision Diagrams compress Boolean functions into compact graphs used in verification and circuit design. This guide covers reduction rules, ROBDDs, a C example, and applications.
Polymorphism in C++, Java and Python: Code Examples Explained
Polymorphism lets a single method call take many forms. This practical guide explains compile-time vs runtime polymorphism and walks through runnable C++, Java, and Python examples you can try right away.
Top Coding Competitions (Coding Comps) to Boost Your Career & Skills
Coding competitions are the fastest way to sharpen your problem-solving skills. Here are the best competitive programming platforms and contests to enter in 2026, for every level.
Generating fast sorting routines
In a lot of programs my gensort-utility turned out to be very useful. It consists simply of the header file
Sort Huge amount of data using C Programming Language
The big sort routine implements a way to sort huge amounts of data using C programming language. It sorts the data that do not fit into main memory by using a multi-phase sorting on files. It is a implementation from the book “Algorithms and data structures” by Niklaus Wirth. Additionally, this routine recognizes small amounts of data that do fit into memory and resorts to a in-place quicksort.