Back to Repositories

Testing Space Complexity Patterns in hello-algo

This test suite evaluates space complexity implementations in Go, covering constant, linear, quadratic, and exponential space usage patterns. It validates various recursive and iterative algorithms while testing memory allocation behaviors across different computational complexity scenarios.

Test Coverage Overview

The test suite provides comprehensive coverage of space complexity patterns.

Key areas tested include:

Constant space complexity operations
Linear space allocation in both iterative and recursive implementations
Quadratic space usage patterns
Exponential space complexity via tree structures
Binary tree construction and visualization

Implementation Analysis

The testing approach systematically validates different space complexity categories using Go’s testing framework. The implementation employs direct function calls to verify space usage patterns, with a particular focus on recursive vs iterative implementations for comparative analysis.

Notable patterns include:

Direct test assertions for space complexity verification
Integration with custom tree visualization utilities
Structured test organization for complexity categories

Technical Details

Testing infrastructure includes:

Go testing package for test execution
Custom tree printing utility from hello-algo package
Integration with standard Go testing patterns
Binary tree construction utilities

Best Practices Demonstrated

The test implementation showcases several testing quality practices.

Notable examples include:

Clear separation of complexity categories
Comprehensive coverage of edge cases
Efficient test organization
Integration of visualization tools for verification
Modular test structure for maintainability

krahets/hello-algo

codes/go/chapter_computational_complexity/space_complexity_test.go

            
// File: space_complexity_test.go
// Created Time: 2022-12-15
// Author: cathay ([email protected])

package chapter_computational_complexity

import (
	"testing"

	. "github.com/krahets/hello-algo/pkg"
)

func TestSpaceComplexity(t *testing.T) {
	n := 5
	// 常数阶
	spaceConstant(n)
	// 线性阶
	spaceLinear(n)
	spaceLinearRecur(n)
	// 平方阶
	spaceQuadratic(n)
	spaceQuadraticRecur(n)
	// 指数阶
	root := buildTree(n)
	PrintTree(root)
}