c to python code converter
import sys
def mergesort_2ndstep(l, r):
len_l = len(l)
len_r = len(r)
# initializing a list of length zero
sorted_array = []
i,j = 0,0
while i < len_l:
num1 = l[i]
for x in range(j,len_r):
num2 = r[x]
if num2 < num1 :
sorted_array.append(num2)
j += 1
sorted_array.append(num1)
i += 1
if len(sorted_array) != len_l + len_r:
# Checking extreme conditions
sorted_array[i+j:] = r[j:]
return sorted_array
def mergesort_1ststep(L,start,stop):
# a list can be divided into two
# if length of list is atleast two
if stop - start > 1:
l = mergesort_1ststep(L,start,start + (stop-start)//2)
r = mergesort_1ststep(L,start + (stop-start)//2,stop)
# mergeing two lists(sorting the l and r parts)
L[start:stop] = mergesort_2ndstep(l,r)
return L[start:stop]
# START
List_of_nums = []
file_to_open = "input1.txt"
try:
read_file = open(file_to_open,"r")
write_file = open("sameeraz.txt","w")
if read_file != None:
# appending every num from file to list_of_nums
for line in read_file:
line = int(line)
List_of_nums.append(line)
# applying mergesort
mergesort_1ststep(List_of_nums,0, len(List_of_nums))
# writing to an output file
# excluding the last element
k = List_of_nums.pop()
for num in List_of_nums:
write_file.write(f"{num}\n")
# writing last element without next line
write_file.write(f"{k}")
read_file.close()
write_file.close()
except:
print("file not found")
3.78
9
#include <stdio.h>
int main()
{
char name [20] = "Lakshmisprasad";
char email [40]="[email protected]";
char slack[10]="@lakshmip";
char twitter[20]="Lakshmip2798";
char biostack [20]="Functional Genomics";
printf("name:%s\nemail:%s\ntwitter:%s\nbiostack:%s\nslack:%s\n",name,email,twitter,biostack, slack );
return 0;
}
Thank you!
9
0
3.9
12
#include<iostream>
// Defining MAX size to 10
#define MAX 10
using namespace std;
typedef struct Edge
{
int source;
int destination;
int weight;
}Edge;
void bellman_ford_algo(int nodevertex,Edge edge[],int source_graph,int nodeedge)
{
int u,v,weight,i,j=0;
int distance[MAX];
for(i=0;i<nodevertex;i++)
{
distance[i]=999;
}
// distance of source vertex
distance[source_graph]=0;
// free all the edges nodevertex - 1 times
for(i=0;i<nodevertex-1;i++)
{
for(j=0;j<nodeedge;j++)
{
u=edge[j].source;
v=edge[j].destination;
weight=edge[j].weight;
if(distance[u]!=999 && distance[u]+weight < distance[v])
{
distance[v]=distance[u]+weight;
}
}
}
// checking for negative cycle
for(j=0;j<nodeedge;j++)
{
u=edge[j].source;
v=edge[j].destination;
weight=edge[j].weight;
if(distance[u]+weight < distance[v])
{
cout<<"\n\nNegative Cycle present..!!\n";
return;
}
}
cout<<"\nVertex"<<" Distance from source";
for(i=1;i<=nodevertex;i++)
{
cout<<"\n"<<i<<"\t"<<distance[i];
}
}
int main()
{
int nodevertex,nodeedge,source_graph;
Edge edge[MAX];
cout<<"Enter the number of vertices you want : ";
cin>>nodevertex;
printf("Enter the source vertex of the graph: ");
cin>>source_graph;
cout<<"\nEnter no. of edges you want : ";
cin>>nodeedge;
for(int i=0;i<nodeedge;i++)
{
cout<<"\nEdge Number "<<i+1<<"=";
cout<<"\nEnter source vertex here :";
cin>>edge[i].source;
cout<<"Enter destination vertex here:";
cin>>edge[i].destination;
cout<<"Enter weight here :";
cin>>edge[i].weight;
}
bellman_ford_algo(nodevertex,edge,source_graph,nodeedge);
return 0;
}
Thank you!
12
0
4
4
np.linspace(0,1,11)
Thank you!
4
0
3.4
5
def main():
# 4 x 4 csr matrix
# [1, 0, 0, 0],
# [2, 0, 3, 0],
# [0, 0, 0, 0],
# [0, 4, 0, 0],
csr_values = [2, 3, 1, 4,5]
col_idx = [1, 2, 0, 1,1]
row_ptr = [0, 2, 4,5]
csr_matrix = [
csr_values,
col_idx,
row_ptr
]
dense_matrix = [
[0, 3, 0],
[1, 4, 5],
[2, 0, 0],
]
res = [
[0, 0, 0],
[0, 0, 0],
[0, 0, 0],
]
# matrix order, assumes both matrices are square
n = len(dense_matrix)
# res = dense X csr
csr_row = 0 # Current row in CSR matrix
for i in range(n):
start, end = row_ptr[i], row_ptr[i + 1]
for j in range(start, end):
col, csr_value = col_idx[j], csr_values[j]
for k in range(n):
dense_value = dense_matrix[k][csr_row]
res[k][col] += csr_value * dense_value
csr_row += 1
print(res)
if __name__ == '__main__':
main()
Thank you!
5
0
3.8
10
#include <stdio.h>
int main()
{
int n,np=0,i,j,flag=0;
scanf("%d",&n);
for(i=2;i<=n;i++)
{
for(j=1,flag=0;j<=i;j++)
{
if(i%j==0)
flag++;
}
if(flag==2)
np++;
}
int total=n-2+1;
for(i=total/2;i>=1;i--)
if(total%i==0&&np%i==0)
{
total/=i;
np/=i;
}
printf("%d/%d",np,total);
return 0;
}
Thank you!
10
0
Are there any code examples left?
New code examples in category Python
-
Python 2023-04-11 03:04:20
-
Python 2022-03-27 22:40:04 pycharm no module named
-
Python 2022-03-27 22:25:05 assign multiple variablesin one line
-
Python 2022-03-27 22:20:02 levenshtein distance
-
Python 2022-03-27 21:35:09 get text from url python last slash
-
Python 2022-03-27 21:30:30 df concatenate df
-
Python 2022-03-27 21:25:09 python odd or even
-
Python 2022-03-27 21:15:32 python include function from another file
-
Python 2022-03-27 21:10:01 color module python
-
Python 2022-03-27 21:00:27 python tkinter cursor types