Back To Course Home

C Programming for Experienced Engineers

0% completed

Getting Started

Who Should take this Course and Why?Lesson Structure

Basic Control Flow

Introduction Example 1: Round Off to Another Integer's Multiple Example 2: Conversion from Cartesian to Polar Coordinates Example 3: Swap Two Variables Example 4: Weight Conversions Example 5: Calculate the Dimensions of a Paper Given the Size Example 6: Solve the Denomination Problem Example 7: Distance Between the Two Points

Decision Making

Introduction Example 8: Find the Greatest Number Example 9: Determine the Character Type Example 10: Solve the Quadratic Equation Example 11: Check if a Given Year Is a Leap Year Example 12: Find the Position of a Point Example 13: Determine the Type of a Triangle Example 14: Determine the Collinear Points Example 15: Find the Position of a Point on the Plane Example 16: Determine the Weight Class of a Boxer Example 17: Display Zodiac Sign Example 18: Calculate Utility Bill Example 19: RGB to CMYK Color Conversion

Loops

Introduction Example 20: Wolf and Rabbit Population Example 21: Combination of Numbers Example 22: Four-Digit Perfect Square Example 23: Prime Numbers Example 24: Base Conversion Example 25: Natural Logarithm Series Example 26: Generate Pythagorean Triple Example 27: Evaluate Exponential Series Example 28: Factorial of a Number Example 29: Ramanujan Number Series Example 30: Armstrong Numbers Example 31: Number Pattern Example 32: Fibonacci Series Example 33: Calculate Interest Example 34: Day Clock

Functions

Introduction Example 35: Integer to Roman Conversion Example 36: Find LCM and GCD Example 37: Determine the Position of a Point Example 38: Calculate Power Example 39: Prime Factors Example 40: Pascal's Triangle

Pointers

Introduction Example 41: Arithmetic Operations Example 42: Area and Perimeter of a Triangle Example 43: Calculate Sum, Average, and Standard Deviation Example 44: Area of a Triangle

Recursion

Introduction Example 45: Sum of the First n Natural Numbers Example 46: Tower of Hanoi Example 47: Prime Factors of a Number Example 48: The Sum of the Digits of a Number Example 49: Calculate a Factorial Example 50: Paper Sizes Example 51: The Fibonacci Sequence Example 52: Decimal to Binary Conversion

Preprocessor

Introduction Example 53: Write Macro Definitions Example 54: Area and Perimeter Example 55: Arithmetic Operation Example 56: Calculate Interest Example 57: Angle Conversion

Arrays

Example 58: Mean, Median, and Mode

Example 59: Implementation of a Stack of Integers

Example 60: Frequency of Positive, Negative, and Zero

Example 61: Quicksort

Example 62: Linear Search

Example 63: Binary Search

Example 64: Compare Arrays

Example 65: Rotate an Array

Example 66: Reverse an Array

Example 67: Decimal to Binary Conversion

Example 68: Sieve of Eratosthenes

Multi-Dimensional Arrays

Introduction Example 69: Transpose a Matrix Example 70: Addition of Matrices Example 71: Product of Matrices Example 72: Access 2-D Array Elements in a Spiral Example 73: Largest Square Submatrix with All 1s

Strings

Introduction Example 74: Common String Functions Implementation Example 75: Extract a Substring Example 76: Count Vowels, Consonants, and Words Example 77: Delete Vowels Example 78: Reverse a String Example 79: Fibonacci Words Example 80: Verify a Credit Card Number Example 81: Verify an ISBN Number Example 82: Display a Calendar Example 83: Sorting Names Example 84: Generate a Combination of Characters Example 85: Expanded Digit Printing Example 86: Conversion from Number to Words

Structures

Introduction Example 87: Sort Dates Example 88: Implementation of a Linked List Example 89: Implementation of a Stack as a Linked List Example 90: Implementation of Queues as a Linked List Example 91: Cricket Scores

File IO

Introduction Example 92: Reading from the File Example 93: Sort Records in a File Example 94: Encryption and Decryption of a File Example 95: File Copying

Bitwise Operators

Introduction Example 96: Print Binary Value Example 97: Pack Information in Bits

Miscellaneous Features

Example 98: Function Pointers Example 99: Function with a Variable Number of Arguments Example 100: Sort Dates Using Bit Fields Example 101: Store Information Using Bit Fields

The Final Note

Example 61: Quicksort

Learn how to implement quicksort.

We'll cover the following

- Problem
- Example
- Demonstration
- Try it yourself
- Solution
- Explanation

Problem

Quicksort is a popular sorting method. The name comes from the fact that, in general, Quicksort can sort a list of data elements significantly faster than any other common sorting algorithms. This algorithm is based on the fact that it is faster and easier to sort two small arrays than one larger array. Thus, the basic strategy of Quicksort is to divide and conquer.

Write a program to sort an array in ascending order using the Quicksort algorithm.

Get hands-on with 1400+ tech skills courses.