Hacker News new | past | comments | ask | show | jobs | submit login

I couldn’t get it to write a working B+tree implementation in Python. There was always some bug that would make it fail at some point.

It’s good, don’t get me wrong, but if you go deep it’s usually incorrect somewhere.




It's pretty goood for me. It's saved me literally thosands of hours of work already. I ran a bunch of problems from Leetcode into it, and it got most of them right.

Here's the b+tree implementation it gave me. I haven't checked if it's right. But, I was just curious what it'd come up with.

https://chat.openai.com/share/a582aa43-cca8-426a-a4de-f45fdb...




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: