π―
This file contains hidden or 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
// The name of the Python script that returns the scraped data is scrape_data.py | |
let scrapeJSON = 'http://bluegalaxy.info/cgi/scrape_data.py' | |
$.get(scrapeJSON, function(data) { | |
// Get JSON data from Python script | |
if (data){ | |
console.log("Data returned:", data) | |
} | |
jobDataJSON = JSON.parse(data) |
This file contains hidden or 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 requests | |
jsonData = requests.get(r'https://api.stagingjobshq.com/madgexWidgetJobs.php?callback=displayJobs&city=Moorhead&state=Minnesota', verify=False).text.strip() | |
return jsonData |
This file contains hidden or 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
def main(){ | |
x:=H(false); | |
return measure(x); | |
} |
This file contains hidden or 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
def main() { | |
x:=H(false); | |
return measure(x); | |
} |
This file contains hidden or 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
Read name | |
echo $name |
This file contains hidden or 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
class Website: | |
def __init__(self, name, url): | |
self.name = name | |
self.url = url | |
def print_url(self): | |
print("Name of Website " + self.name + "and URL "+ self.url) | |
web1 = Website("NeptuneWorld", "https://neptuneworld.in/") | |
web1.print_url() |
This file contains hidden or 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
# Insertion Recursive Algorithm | |
function insertionSortR(array A, int n) | |
if n > 0 | |
insertionSortR(A, n-1) | |
x β A[n] | |
j β n-1 | |
while j >= 0 and A[j] > x | |
A[j+1] β A[j] | |
j β j-1 | |
end while |
This file contains hidden or 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
# Insertion Sort Algorithm2 | |
i β 1 | |
while i < length(A) | |
x β A[i] | |
j β i - 1 | |
while j >= 0 and A[j] > x | |
A[j+1] β A[j] | |
j β j - 1 | |
end while | |
A[j+1] β x |
This file contains hidden or 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
# Insertion Sort Algorithm | |
i β 1 | |
while i < length(A) | |
j β i | |
while j > 0 and A[j-1] > A[j] | |
swap A[j] and A[j-1] | |
j β j - 1 | |
end while | |
i β i + 1 | |
end while |
This file contains hidden or 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
# Insertion sort | |
def Insertion_sort(arr, itr): | |
lgth = len(arr) | |
for i in range(1,lgth): | |
x,j = arr[i],i-1 | |
while j>=0 and arr[j]>x: | |
arr[j+1] = arr[j] | |
j-=1 | |
arr[j+1] = x | |
print("Iteration:",i,arr) |