Nashtic

liste_1=[4,-3,5,-2,-1,2,6,-2]
max_1=0
for i in range(8):
    for j in range(i,8):
        t=0
        for k in range(i,j):
            t=t+liste_1[k]
        if max_1<t:
            max_1=t
            i_1,i_2=i,j

Nashtic

def insertionSort(arr):                 """Insertion Sort Fonksiyonu"""
    n = len(arr)
    for i in range(1,n):
        key = arr[i]
        j = i-1
        while j >= and key<arr[j]       
            arr[j+1]=arr[j]
            j=j-1
        arr[j+1]=key
    

Nashtic

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>

int main()
{

    char ch[100]="C";
    char b[100]="Dilini";

Nashtic

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>

max_of_four(int a, int b, int c, int d){
    if(a>b && a>c && a>d){
        return a;
    }
    else if(b>a && b>c && b>d){

Nashtic

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>

int main() {
    int veri1, veri2;
    float veri3, veri4;

    scanf("%d",&veri1);