|
convert c++ to mips assembly code online
<![CDATA[#include <stdio.h>
int main() {
int i;
int sum = 0;
for (i=0; i<=100; i++)
sum = sum + i*i;
printf("The sum from 0 to 100 is %d\n",sum);]]>
convert c++ to mips assembly code online
<![CDATA[#include <stdio.h>
void main(void)
{
int x,y,z;
printf("please enter the number 1 :\n");
scanf("%d",&x);
printf("please enter the number 2 :\n");
scanf("%d",&y);
printf("please enter the number 3 :\n");
scanf("%d",&z);
printf("the number 3:%d \n",z);
printf("the number 2:%d \n",y);
printf("the number 1:%d \n",x);
}
]]>
convert c++ to mips assembly code online
<![CDATA[int fib_iter(int a,int b,int n){
if(n==0)
return b;
else
return fib_iter(a+b,a,n-1);
}]]>
convert c++ to mips assembly code online
<![CDATA[#include<iostream>
using namespace std;
int main(){
int x=1,y=2;
int z=x+y;
cout<<z;
}]]>
convert c++ to mips assembly code online
<![CDATA[
#include <iostream>
using namespace std;
void heapify(int arr[], int n, int i)
{
int largest = i;
int l = 2 * i + 1;
int r = 2 * i + 2;
if (l < n && arr[l] > arr[largest])
largest = l;
if (r < n && arr[r] > arr[largest])
largest = r;
if (largest != i) {
swap(arr[i], arr[largest]);
heapify(arr, n, largest);
}
}
void deleteRoot(int arr[], int& n)
{
int lastElement = arr[n - 1];
arr[0] = lastElement;
n = n - 1;
heapify(arr, n, 0);
}
void printArray(int arr[], int n)
{
for (int i = 0; i < n; ++i)
cout << arr[i] << " ";
cout << "\n";
}
int main()
{
int arr[] = { 10, 5, 3, 2, 4 };
int n = sizeof(arr) / sizeof(arr[0]);
deleteRoot(arr, n);
printArray(arr, n);
return 0;
}
]]>
convert c++ to mips assembly code online
<![CDATA[#include<bits/stdc++.h>
using namespace std;
int main()
{
int n,r=1;
scanf("%d",&n);
string s[] = {"Sheldon", "Leonard", "Penny", "Rajesh", "Howard"};
while (r * 5 < n)
{
n -= r * 5;
r *= 2;
}
n=n-1;
n=n/r;
cout<<s[n]<<endl;
return 0;
}]]>
convert c++ to mips assembly code online
<![CDATA[# Not sure what to do now? Enter your mips code here ]]>
|
