THEY ARE NICE

beacause time complexity and space complexity is better

TAKE THAT BACK

where u write the code swapping

i am finishing it up

ya

beacause time complexity and space complexity is better

firstly you want to use xor not addition or subtraction

for some architectures you should use mov actually

firstly you want to use xor not addition or subtraction

you know time complexity

the reason for this is due to the fact that there are 0 instruction moves

the reason for this is due to the fact that there are 0 instruction moves

means

the reason for this is due to the fact that there are 0 instruction moves

where several moves are done in one instruction cycle

so in the time it takes to do an addition you do like 6 moves

where several moves are done in one instruction cycle

yaa

#include <stdio.h> main() { int a = 10; int b = 20; int c = 0; c = a; a = b; b = c; }

so the most effective code for most CPUs so far was this one

so in the time it takes to do an addition you do like 6 moves

where are you from? sir

born in US grew up in Ukraine and Russia now i live in Canada

so the most effective code for most CPUs so far was this one

but i am sad that this person did not use the more common way to do this

#include <stdio.h> main() { int a = 10; int b = 20; int c = 0; c = a; a = b; b = c; }

ya but executions time more

so the most effective code for most CPUs so far was this one

I'm lazy

ya but executions time more

no it is actually not

that is the faster execution time

lol

born in US grew up in Ukraine and Russia now i live in Canada

I am from india

it is faster to do 3 moves then to do one addition

for MOST CPUs

I am from india

lol that comparisement

no it is actually not

but why

I'm groot

but why

because of zero instruction moves

you can do a move in less time then it takes to actually execute a function

for example let's say we decode 2 instructions

one is a move and the other is an addition

for the move we just have to swap the 2 register values

this is quite easy to do or you can do a push operation back onto the stack

so you move your stack pointer to the location of one of them

for example let's say we decode 2 instructions

6 instruction

and just push both registers

6 instruction

no

no

but why?

LDM r1, {r1-r4}

this does 1 thing which is load multiple registers starting at the offset given in r1

this is for arm asm

LDM r1, {r1-r4}

ohh

then you can do the same thing and push everything

PUSH {r1-r4, lr}

then you can do the same thing and push everything

yaa

you can also do STRM

and this is 1 instruction to decode

and can be done by 1 circuit

what is STRM

i mean STM

store multiple registers

this is for ARM v7?

store multiple registers

ohh

i forget but this is the most recent ASM in my mind after x86_64

which i am doing now for my swap program

however the issue with x86_64 is that it looks like it is more instructions but it is really not

which i am doing now for my swap program

Any Note available in c++ giving me

they do a bunch of moves because these can be done within 1 third of a clock cycle or faster

they do a bunch of moves because these can be done within 1 third of a clock cycle or faster

ya I know

which makes it faster then an addition

basic concept of programming language

because addition requires waiting for the ALU to free up

then to actually go and do the addition

then to actually go and do the addition

where go

for your algorithm the CPU does, decode instruction move registers to ALU ALU synchronizes inputs decodes instruction to ALU for which unit to use use adder to add inputs move back to register decode next instruction move registers to ALU ALU synchronizes inputs decodes instruction to ALU for which unit to use use complementor to do 2s complement on one of the inputs use adder to add inputs move back to register

🙏🙏

now there is something called super scalar that says some of these steps happen at the same time

however in comparision to the pop and push onto the stack

however in comparision to the pop and push onto the stack

ya

now the other trick that people like to use is xors

xors are easy to use and fast

however in comparision to the pop and push onto the stack

how to problem solve tower of hanoi in c++

let me explain deeply

and what you do is: xor x, x, y xor y, x, y xor x, x, y

this requires a larger footprint on the code

and what you do is: xor x, x, y xor y, x, y xor x, x, y

tower of hanoi

however a smaller one in terms of memory

and xor is typically a smaller instruction to decode

this requires a larger footprint on the code

u know tower of hanoi