Apoorv Singal

Thanks guys! The website is soo awesome! I love it! And thank you for all your wishes people!

@zplusfour Thanks zplusfour! Aight, time to binge-watch it then lmao

@Codeverse lmaoo not sure what exactly this story is but Yayy! Thanks!!

@JWZ6 Thanks!

Thanks Cow!

Thanks @Coder100! I am 17 now lol

@Wilke000 HAPPY BDAY!! 🥳

Thanks @EitanGJ!

@IntellectualGuy Thanks! Lmao I have been in quarantine ever since I started coding...

@PyCoder01 yess

@Bookie0 lol same. Thanks Bookie!

@SilvermoonCat Thanks!

Thanks! @IcynHackz

Thanks! @PyCoder01

@RayhanADev YAY Thanks!

@AmazingMech2418 Well, no.
Unlike CPP, Volant isn't object-oriented. You understand how big of a difference that is, right? I don't even need to say anything more but,

Volant has garbage collection.
Volant support for closures is far better than CPP.
Volant doesn't have exceptions (errors should be handled by returning a tuple).
Volant has an in-built event system and thread-management system (it uses libuv and its not in a usable state yet).
Volant has (not yet) async/await and concurrency primitives.

Volant "syntax modifications" aren't just randomly chosen. Every difference from the c syntax has a very specific purpose. For example, Volant's version of CPP's int ((*var[10])(int, int))(int, int) is var: [10] * func(int, int) (func (int, int) int). You can clearly see the superiority of Volant syntax here. Volant syntax is chosen very precisely to be as simple, clean, and readable as possible.

@AmazingMech2418 Volant uses c as an intermediate representation and there are countless other languages that do the same. No sane person would ever write a compiler to asm if he isn't immortal or doesn't have a team of 20 devs.
Also, it would have been an absolute waste of time to write a compiler to asm because Volant does not need any more access to the machine than what c gives.

bruh there are even submissions that have been under development for literally years

@AmazingMech2418 What's bad about that? What's the point in rewriting those libraries when we can just use them?

Lmoa I should have been less lazy and checked for typos in my answers.

Thanks :) @Jakman

You can loop through all odd numbers from 10 to 100 and check if the number is divisible by any number smaller than itself but this approach will be very inefficient.
You can not generate prime numbers with any better way as they don't follow any specific pattern.
The best way, according to me, is to create an array of all primes yourself.

@heyitsmarcus That wasn't a hint. You told just everything.

Thanks @LingWu1! noted. Will binge-watch it really soon lmao

Thanks @DREWNOLT! Lol yess! Why do you think they call me kaka

Thanks! @ShaheenUmair

@ShionaSamavedam Thanks :)

@CodeSalvageON Ah lmao me dumb

@Codeverse lol thanks

@TheC0derGirl ThAnkS THeC0DeRGirL!