🏠 Home
Benchmark Hub
📊 All Benchmarks 🦖 Dinosaur v1 🦖 Dinosaur v2 ✅ To-Do List Applications 🎨 Creative Free Pages 🎯 FSACB - Ultimate Showcase 🌍 Translation Benchmark
Models
🏆 Top 10 Models 🆓 Free Models 📋 All Models ⚙️ Kilo Code
Resources
💬 Prompts Library 📖 AI Glossary 🔗 Useful Links
📖
C4.5 and C5.0

C4.5 computational complexity

Algorithmic cost of C4.5 on the order of O(n * m * log n) where n is the number of instances and m is the number of attributes, optimized by sorting and incremental computation techniques.

← Back