Saad Amin saada2006
saada2006
/ System Diagnostics
Created
May 3, 2024 02:08
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| "LD_* scout runtime" information: | |
| { | |
| "steam-runtime-system-info" : { | |
| "version" : "0.20240301.0+srt1", | |
| "path" : "/home/saad/.steam/debian-installation/ubuntu12_32/steam-runtime/amd64/usr/bin/steam-runtime-system-info" | |
| }, | |
| "can-write-uinput" : true, | |
| "steam-installation" : { | |
| "path" : "/home/saad/.steam/debian-installation", | |
| "data_path" : "/home/saad/.steam/debian-installation", |
saada2006
/ System Info
Created
May 3, 2024 02:06
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Computer Information: | |
| Manufacturer: ASUSTeK COMPUTER INC. | |
| Model: ROG MAXIMUS XIII EXTREME | |
| Form Factor: Desktop | |
| No Touch Input Detected | |
| Processor Information: | |
| CPU Vendor: GenuineIntel | |
| CPU Brand: 11th Gen Intel(R) Core(TM) i9-11900K @ 3.50GHz | |
| CPU Family: 0x6 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| selection_sort_time | insertion_sort_time | |
|---|---|---|
| 1.74389e-05 | 2.12045e-05 | |
| 1.23917e-05 | 1.90239e-05 | |
| 1.29517e-05 | 2.01257e-05 | |
| 1.19994e-05 | 1.71403e-05 | |
| 1.22476e-05 | 2.22748e-05 | |
| 1.19855e-05 | 1.79532e-05 | |
| 1.18039e-05 | 1.92159e-05 | |
| 1.57361e-05 | 2.2902e-05 | |
| 1.40131e-05 | 1.91117e-05 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| import java.awt.Desktop; | |
| import java.io.*; | |
| import java.sql.Timestamp; | |
| import java.util.ArrayList; | |
| public class Main { | |
| public static boolean pinging = true; | |
| public static final long DELAY = 100; | |
saada2006
/ DUDEZDownloader.java
Created
October 21, 2022 10:12
Since the dudez website didn't have a download button, here is a program to download the stuff for you...
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| // Basically I couldn't find the download link on the dudez page | |
| // So here is my own downloader | |
| import java.io.BufferedReader; | |
| import java.io.BufferedWriter; | |
| import java.io.File; | |
| import java.io.FileWriter; | |
| import java.io.IOException; | |
| import java.io.InputStream; | |
| import java.io.InputStreamReader; |
saada2006
/ DeadstockTask.java
Last active
October 4, 2022 00:33
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| import java.net.*; | |
| import javax.net.SocketFactory; | |
| import javax.net.ssl.SSLSocketFactory; | |
| import java.io.*; | |
| public class DeadstockTask { | |
| public static void main(String[] args) { |
saada2006
/ hilbert_curve.cpp
Created
July 18, 2022 23:15
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /* | |
| Breinholt and Schierz 1998 | |
| Implementation idea: we can recursively subdivide the square into 4 independent parts, and evaluate each seperately | |
| Note that the order in which the squares are evaluated matters!!! | |
| The simplygy this process, let us simplyfy the i1 and i2 to up, down, left and right (according to the direction of the perpendicualer edge from the center): | |
| Up = 0, 0 | |
| Down = 1, 1 |