Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

Sorting and Searching Algorithms in Go

Go to class Write review

Overview

This comprehensive course is specially designed to impart a fundamental and advanced understanding of sorting and searching algorithms. The course will guide you through different types and functionalities of these algorithms, their complexity analysis, and practical application in resolving complex programming problems.

Syllabus

Unit 1: Understanding Recursion in Go

Counting Even Digits with Recursion in Go
Planetary Digit Tally Fix
Sum of Digits Using Recursion in Go

Unit 2: Introduction to Binary Search with Go

Binary Search with Insertion Index
Fix the Infinite Recursion in Go's Binary Search
Binary Search Implementation with Missing Sections
Iterative Binary Search in Go

Unit 3: Introduction to Advanced Binary Search Problems in Go

Finding an Element in a Bitonic Array using Binary Search in Go
Find the Maximum in a Cyclically Sorted Array

Unit 4: Sorting in Go: Utilizing Go's Built-in Functions for Effective Data Organization

Sorting Grocery Items Alphabetically in Go
Sort Movies by Descending Ratings
Sort Players by Score and Age

Unit 5: Quick Sort Algorithm: Exploring and Implementing in Go

Quick Sort: Implement Partition Function
Quick Sort Space Rocks in Go
Fixing the Quick Sort Bug in Go

Unit 6: Merge Sort in Go

Fix the Merge Sort Bug in Go
Enhance Merge Sort Process in Go
Complete the Merge Sort Function in Go

Unit 7: Advanced Sorting Algorithms and Their Practical Applications

Identifying the k-th Rarest Artifact in Go
Counting Inversions in an Array

Reviews

Start your review of Sorting and Searching Algorithms in Go