Here's an example of reading from a file line by line in Python.

import os
import uuid

filename = str(uuid.uuid4()) # create random file name
wLines = ["First line\n", "Second line\n", "Third line\n"]

# writing lines to file
f = open(filename, 'w')
f.writelines(wLines)
f.close()

#--------------------------------------------------------#

print("-----Read lines using 'readlines' method-----")
f = open(filename, 'r')
rLines = f.readlines()

for lineNumber, line in enumerate(rLines, 1):
	print("Line {}: {}".format(lineNumber, line.strip()))

#--------------------------------------------------------#

print("-----Read lines using 'readline' method-----")
f = open(filename, 'r')
lineNumber = 1
 
while True:
    lineNumber += 1
 
    # Get next line from file
    line = f.readline()
 
    # if line is empty
    # end of file is reached
    if not line:
        break
    print("Line {}: {}".format(lineNumber, line.strip()))
 
f.close()

#--------------------------------------------------------#

print("-----Read lines via file object iteration-----")
f = open(filename, 'r')

for lineNumber, line in enumerate(f, 1):
    print("Line {}: {}".format(lineNumber, line.strip()))

#--------------------------------------------------------#

print("-----Read lines via file contex manager-----")
with open(filename, "r") as f:
    for lineNumber, line in enumerate(f, 1):
        print("Line {}: {}".format(lineNumber, line.strip()))

os.remove(filename) # remove file

# Output example:

# Read lines using 'readlines' method
# Line 1: First line
# Line 2: Second line
# Line 3: Third line

main.py

Python

Read a file line by line in Python

In this code, the quick_sort function is a recursive implementation of the Quick Sort algorithm. The pivot element is chosen as the first element of the array, and elements are partitioned into two sub-arrays (left and right) based on their relationship to the pivot. The function is then called recursively on the left and right sub-arrays until the entire array is sorted.

def quick_sort(arr):
    if len(arr) <= 1:
        return arr
    else:
        pivot = arr[0]
        left = [x for x in arr[1:] if x <= pivot]
        right = [x for x in arr[1:] if x > pivot]
        return quick_sort(left) + [pivot] + quick_sort(right)

# Example usage:
input_array = [3, 1, 4, 1, 5, 9, 2, 6, 5, 3, 5]
sorted_array = quick_sort(input_array)

print("Original Array:", input_array)
print("Sorted Array:", sorted_array)


Implementation of the Quick Sort algorithm in Python

Here's a simple implementation of the Quick Sort algorithm in PHP

<?php

function quickSort(array $array): array
{
    $length = count($array);

    if ($length <= 1) {
        return $array;
    }

    $pivot = $array[0];
    $left = $right = [];

    for ($i = 1; $i < $length; $i++) {
        if ($array[$i] < $pivot) {
            $left[] = $array[$i];
        } else {
            $right[] = $array[$i];
        }
    }

    return array_merge(quickSort($left), [$pivot], quickSort($right));
}

// Example usage:
$array = [3, 1, 4, 1, 5, 9, 2, 6, 5, 3, 5];
$sortedArray = quickSort($array);

echo "Original Array: " . implode(", ", $array) . "\n";
echo "Sorted Array: " . implode(", ", $sortedArray) . "\n";



main.php

Simple implementation of the Quick Sort algorithm in PHP

package main

import (
	"errors"
	"fmt"
	"os"
)

func main() {
	filePath := "file.txt"

	if _, err := os.Stat(filePath); errors.Is(err, os.ErrNotExist) {
		fmt.Println("file not exists")
	} else {
		fmt.Println("file exists")
	}
}

Share & grow the world's code base!

Read a file line by line in Python

Implementation of the Quick Sort algorithm in Python

Simple implementation of the Quick Sort algorithm in PHP

Check if a file exists or not in Go

Implementation of the Quick Sort algorithm in Python

Simple implementation of the Quick Sort algorithm in PHP

Check if a file exists or not in Go