kehiy

import random


def is_odd(num: int):
    if (num % 2) == 0:
        return False
    return True
    

def collatz(num: int):

kehiy

#include <stdio.h>

int factorial(int n) {
    if (n == 0) {
        return 1;
    }
    return n * factorial(n -1);
}

int main()

kehiy

package main

import (
	"context"
	"crypto/rand"
	"crypto/rsa"
	"crypto/tls"
	"crypto/x509"
	"encoding/pem"
	"fmt"

kehiy

golang performance tips!

resources:

• Phuong Le (@func25) tips: 3 and 4
• chat gpt tips: 1 and 2

1. range instead of i

In Go, using range is typically faster and more efficient than indexing in a for loop.

When you use range in a for loop, the compiler generates code that efficiently iterates over the underlying data structure. In contrast, when you use indexing to access elements in a slice or array, the compiler generates additional instructions to calculate the offset of each element based on its index.

kehiy

package main

import (
    "bufio"
    "fmt"
    "net"
    "os"
)

func main() {

kehiy

package main

import (
	"bytes"
	"crypto/rand"
	"encoding/binary"
	"fmt"
	"io"
	"log"
	"net"

kehiy

package main

import "net"

func main() {
  Conn, _ := net.DialUDP("udp", nil, &net.UDPAddr{IP:[]byte{127,0,0,1},Port:3000,Zone:""})
  defer Conn.Close()
  Conn.Write([]byte("hello, gofarsi!"))
}

kehiy

package main

import (
	"fmt"
	"io"
	"net/http"

	"golang.org/x/net/websocket"
)

kehiy

package main

import (
	"fmt"
	"net"
)


func main() {
	conn, err := net.ListenUDP("udp", &net.UDPAddr{

kehiy

package main

import (
	"fmt"
	"log"
	"net"
)

type Message struct {
	from    string